cirq_google.line.AnnealSequenceSearchStrategy
Linearized sequence search using simulated annealing method.
Inherits From: LinePlacementStrategy
cirq_google.line.AnnealSequenceSearchStrategy(
trace_func: Optional[Callable[[List[LineSequence], float, float, float, bool], None]] = None,
seed: Optional[int] = None
) -> None
efficiency improvements.
Github issue: https://github.com/quantumlib/Cirq/issues/2217
Args |
trace_func
|
Optional callable which will be called for each
simulated annealing step with arguments: solution
candidate (list of linear sequences on the chip),
current temperature (float), candidate cost (float),
probability of accepting candidate (float), and
acceptance decision (boolean).
|
seed
|
Optional seed value for random number generator.
|
Methods
place_line
View source
place_line(
device: 'cirq_google.GridDevice', length: int
) -> cirq_google.line.placement.GridQubitLineTuple
Runs line sequence search.
Args |
device
|
Chip description.
|
length
|
Required line length.
|
Returns |
List of linear sequences on the chip found by simulated annealing
method.
|
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."],[],[]]