- class SabreLayout(*args, **kwargs)¶
Choose a Layout via iterative bidirectional routing of the input circuit.
Starting with a random initial Layout, the algorithm does a full routing of the circuit (via the routing_pass method) to end up with a final_layout. This final_layout is then used as the initial_layout for routing the reverse circuit. The algorithm iterates a number of times until it finds an initial_layout that reduces full routing cost.
This method exploits the reversibility of quantum circuits, and tries to include global circuit information in the choice of initial_layout.
 Li, Gushu, Yufei Ding, and Yuan Xie. 《Tackling the qubit mapping problem for NISQ-era quantum devices.》 ASPLOS 2019. arXiv:1809.02573
coupling_map (Coupling) – directed graph representing a coupling map.
routing_pass (BasePass) – the routing pass to use while iterating.
seed (int) – seed for setting a random first trial layout.
max_iterations (int) – number of forward-backward iterations.
Return the name of the pass.
Run the SabreLayout 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).