- class StochasticSwap(*args, **kwargs)[source]¶
Map a DAGCircuit onto a coupling_map adding swap gates.
Uses a randomized algorithm.
Measurements may occur and be followed by swaps that result in repeated measurement of the same qubit. Near-term experiments cannot implement these circuits, so some care is required when using this mapper with experimental backend targets.
We do not use the fact that the input state is zero to simplify the circuit.
The coupling map is a connected graph
If these are not satisfied, the behavior is undefined.
coupling_map (Union[CouplingMap, Target]) – Directed graph representing a coupling map.
trials (int) – maximum number of iterations to attempt
seed (int) – seed for random number generator
fake_run (bool) – if true, it only pretend to do routing, i.e., no swap is effectively added.
initial_layout (Layout) – starting layout at beginning of pass.
Return the name of the pass.
Run the StochasticSwap pass on dag.
Check if the pass is an analysis pass.
If the pass is an AnalysisPass, that means that the pass can analyze the DAG and write the results of that analysis in the property set. Modifications on the DAG are not allowed by this kind of pass.
Check if the pass is a transformation pass.
If the pass is a TransformationPass, that means that the pass can manipulate the DAG, but cannot modify the property set (but it can be read).