A verifiable quantum advantage towards real world applications: Quantum Echoes
Learn more
Module: cirq_google.line.placement
Modules
anneal module
chip module
greedy module
line module
optimization module
place_strategy module
sequence module
Classes
class AnnealSequenceSearchStrategy: Linearized sequence search using simulated annealing method.
class GreedySequenceSearchStrategy: Greedy search method for linear sequence of qubits on a chip.
class GridQubitLineTuple: A contiguous non-overlapping sequence of adjacent grid qubits.
class LinePlacementStrategy: Choice and options for the line placement calculation method.
Functions
anneal_minimize(...): Minimize solution using Simulated Annealing meta-heuristic.
line_on_device(...): Searches for linear sequence of qubits on device.
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2025-08-14 UTC.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-08-14 UTC."],[],[]]