Techniques to Reduce $\pi /4$-Parity-Phase Circuits, Motivated by the ZX Calculus

Abstract

To approximate arbitrary unitary transformations on one or more qubits, one must perform transformations which are outside of the Clifford group. The gate most commonly considered for this purpose is the T = diag(1, exp(i π/4)) gate. As T gates are computationally expensive to perform fault-tolerantly in the most promising error-correction technologies, minimising the "T-count" (the number of T gates) required to realise a given unitary in a Clifford+T circuit is of great interest. We describe techniques to find circuits with reduced T-count in unitary circuits, which develop on the ideas of Heyfron and Campbell [arXiv:1712.01557] with the help of the ZX calculus. Following [arXiv:1712.01557], we reduce the problem to that of minimising the T count of a CNOT+T circuit. The ZX calculus motivates a further reduction to simplifying a product of commuting "π/4-parity-phase" operations: diagonal unitary transformations which induce a relative phase of exp(i π/4) depending on the outcome of a parity computation on the standard basis (which motivated Kissinger and van de Wetering [1903.10477] to introduce "phase gadgets"). For a number of standard benchmark circuits, we show that these techniques -- in some cases supplemented by the TODD subroutine of Heyfron and Campbell [arXiv:1712.01557] -- yield T-counts comparable to or better than the best previously known results.

arXiv commentIn Proceedings QPL 2019, arXiv:2004.14750

References in corpus (11)

• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• A survey of graphical languages for monoidal categories
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Novel constructions for the fault-tolerant Toffoli gate
• Towards Large-scale Functional Verification of Universal Quantum Circuits
• Qudit versions of the qubit "pi-over-eight" gate
• Surface code implementation of block code state distillation
• Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
• Scalable Architecture for Quantum Information Processing with Atoms in Optical Micro-Structures
• T-count optimization and Reed-Muller codes
• Braiding by Majorana Tracking and Long-Range CNOT Gates with Color Codes

Cited by in corpus (20)

• There and back again: A circuit extraction tale
• Reconstructing quantum theory from diagrammatic postulates
• Phase polynomials synthesis algorithms for NISQ architectures and beyond
• Quantum Picturalism: Learning Quantum Theory in High School
• Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
• Optimal Hadamard gate count for Clifford$+T$ synthesis of Pauli rotations sequences
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus
• AND-gates in ZX-calculus: Spider Nest Identities and QBC-completeness
• Building Qutrit Diagonal Gates from Phase Gadgets
• An Algebraic Axiomatisation of ZX-calculus
• Scaling W state circuits in the qudit Clifford hierarchy
• Generators and Relations for 2-Qubit Clifford+T Operators
• Generators and Relations for Un(Z[1/2,i])
• Well-tempered ZX and ZH Calculi
• Lower T-count with faster algorithms
• Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning
• ZX Graphical Calculus for Continuous-Variable Quantum Processes
• Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)
• Transversal AND in Quantum Codes
• A Graphical #SAT Algorithm for Formulae with Small Clause Density