Collect2qBlocks
class Collect2qBlocks(*args, **kwargs)
Collect sequences of uninterrupted gates acting on 2 qubits.
Traverse the DAG and find blocks of gates that act consecutively on pairs of qubits. Write the blocks to propert_set as a dictionary of the form:
{(q0, q1): [[g0, g1, g2], [g5]],
(q0, q2): [[g3, g4]]
..
.
}Based on implementation by Andrew Cross.
Attributes
is_analysis_pass
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.
is_transformation_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).
Methods
name
Collect2qBlocks.name()
Return the name of the pass.
run
Collect2qBlocks.run(dag)
Run the Collect2qBlocks pass on dag.
The blocks contain “op” nodes in topological sort order such that all gates in a block act on the same pair of qubits and are adjacent in the circuit. the blocks are built by examining predecessors and successors of “cx” gates in the circuit. u1, u2, u3, cx, id gates will be included.
After the execution, property_set['block_list'] is set to a list of tuples of “op” node labels.