Decompose a Clifford operator into a QuantumCircuit.
For N <= 3 qubits this is based on optimal CX cost decomposition from reference . For N > 3 qubits this is done using the general non-optimal greedy compilation routine from reference , which typically yields better CX cost compared to the AG method in .
clifford (Clifford) – a clifford operator.
method (str) – Optional, a synthesis method (‚AG‘ or ‚greedy‘). If set this overrides optimal decomposition for N <=3 qubits.
a circuit implementation of the Clifford.
S. Bravyi, D. Maslov, Hadamard-free circuits expose the structure of the Clifford group, arXiv:2003.09412 [quant-ph]
S. Aaronson, D. Gottesman, Improved Simulation of Stabilizer Circuits, Phys. Rev. A 70, 052328 (2004). arXiv:quant-ph/0406196
Sergey Bravyi, Shaohan Hu, Dmitri Maslov, Ruslan Shaydulin, Clifford Circuit Optimization with Templates and Symbolic Pauli Gates, arXiv:2105.02291 [quant-ph]