cirq_google.line.AnnealSequenceSearchStrategy

View source on GitHub

Linearized sequence search using simulated annealing method.

Inherits From: LinePlacementStrategy

View aliases

Main aliases

`cirq_google.AnnealSequenceSearchStrategy`, `cirq_google.line.placement.AnnealSequenceSearchStrategy`, `cirq_google.line.placement.anneal.AnnealSequenceSearchStrategy`

cirq_google.line.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

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.XmonDevice",
    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.