- class TrivialLayout(*args, **kwargs)[source]¶
Choose a Layout by assigning
ncircuit qubits to device qubits
0, .., n-1.
A pass for choosing a Layout of a circuit onto a Coupling graph, using a simple round-robin order.
This pass associates a physical qubit (int) to each virtual qubit of the circuit (Qubit) in increasing order.
Does not assume any ancilla.
coupling_map (Union[CouplingMap, Target]) – directed graph representing a coupling map.
TranspilerError – if invalid options
Return the name of the pass.
Run the TrivialLayout 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).