|View source on GitHub|
Linearized sequence search using simulated annealing method.
cirq.google.AnnealSequenceSearchStrategy( trace_func: Callable[[List[LineSequence], float, float, float, bool], None] = None, seed: int = None ) -> None
efficiency improvements. Github issue: https://github.com/quantumlib/Cirq/issues/2217
||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).|
||Optional seed value for random number generator.|
place_line( device: "cirq.google.XmonDevice", length: int ) ->
Runs line sequence search.
||Required line length.|
|List of linear sequences on the chip found by simulated annealing method.|