cirq_google.line.placement.greedy.GreedySequenceSearch
Base class for greedy search heuristics.
cirq_google.line.placement.greedy.GreedySequenceSearch(
device: 'cirq_google.GridDevice', start: GridQubit
) -> None
Specialized greedy heuristics should implement abstract _sequence_search
method.
Args |
device
|
Chip description.
|
start
|
Starting qubit.
|
Raises |
ValueError
|
When start qubit is not part of a chip.
|
Methods
get_or_search
View source
get_or_search() -> cirq_google.line.placement.anneal.LineSequence
Starts the search or gives previously calculated sequence.
Returns |
The linear qubit sequence found.
|
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 2024-06-27 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 2024-06-27 UTC."],[],[]]