A graph-state based synthesis framework for Clifford isometries

Abstract

We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford group and one equation of the symplectic group. We highlight the versatility of our framework by showing that several normal forms of the literature are natural corollaries. We recover the state of the art two-qubit gate depth necessary for the execution of a Clifford circuit on an LNN architecture, concomitantly with another work. We also propose practical synthesis algorithms for Clifford isometries with a focus on Clifford operators, graph states and codiagonalization of Pauli rotations. Benchmarks show that in all three cases we improve the 2-qubit gate count and depth of random instances compared to the state-of-the-art methods. We also improve the execution of practical quantum chemistry experiments.

47 pages, 12 figures, 5 tables

References in corpus (26)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Improved Simulation of Stabilizer Circuits
• Quantum Computing with Very Noisy Devices
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Magic state distillation with low overhead
• Implementing a strand of a scalable fault-tolerant quantum computing fabric
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• Topological and subsystem codes on low-degree graphs with flag qubits
• Hadamard-free circuits expose the structure of the Clifford group
• On the CNOT-complexity of CNOT-PHASE circuits
• Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
• Use of global interactions in efficient quantum circuit constructions
• Clifford Circuit Optimization with Templates and Symbolic Pauli Gates
• Constructing quantum circuits with global gates
• Reducing the Depth of Linear Reversible Quantum Circuits
• Depth optimization of CZ, CNOT, and Clifford circuits
• Optimization of Clifford Circuits
• Phase polynomials synthesis algorithms for NISQ architectures and beyond
• 6-qubit Optimal Clifford Circuits
• A SAT Encoding for Optimal Clifford Circuit Synthesis
• Architecture aware compilation of quantum circuits via lazy synthesis
• CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate
• Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures