cirq_google.line.placement.anneal.AnnealSequenceSearch
Simulated annealing search heuristic.
cirq_google.line.placement.anneal.AnnealSequenceSearch(
device: 'cirq_google.GridDevice', seed=None
) -> None
Args |
device
|
Chip description.
|
seed
|
Optional seed value for random number generator.
|
Methods
search
View source
search(
trace_func: Optional[Callable[[List[LineSequence], float, float, float, bool], None]] = None
) -> List[cirq_google.line.placement.anneal.LineSequence
]
Issues new linear sequence search.
Each call to this method starts new search.
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).
|
Returns |
List of linear sequences on the chip found by this 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."],[],[]]