Quantum Circuits Are Just a Phase

Abstract

Quantum programs today are written at a low level of abstraction - quantum circuits akin to assembly languages - and the unitary parts of even advanced quantum programming languages essentially function as circuit description languages. This state of affairs impedes scalability, clarity, and support for higher-level reasoning. More abstract and expressive quantum programming constructs are needed. To this end, we introduce a simple syntax for generating unitaries from "just a phase"; we combine a (global) phase operation that captures phase shifts with a quantum analogue of the "if let" construct that captures subspace selection via pattern matching. This minimal language lifts the focus from gates to eigendecomposition, conjugation, and controlled unitaries; common building blocks in quantum algorithm design. We demonstrate several aspects of the expressive power of our language in several ways. Firstly, we establish that our representation is universal by deriving a universal quantum gate set. Secondly, we show that important quantum algorithms can be expressed naturally and concisely, including Grover's search algorithm, Hamiltonian simulation, Quantum Fourier Transform, Quantum Signal Processing, and the Quantum Eigenvalue Transformation. Furthermore, we give clean denotational semantics grounded in categorical quantum mechanics. Finally, we implement a prototype compiler that efficiently translates terms of our language to quantum circuits, and prove that it is sound with respect to these semantics. Collectively, these contributions show that this construct offers a principled and practical step toward more abstract and structured quantum programming.

42 pages, 5 figures

References in corpus (25)

• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Quantum computations without definite causal structure
• Experimental Superposition of Orders of Quantum Gates
• Complete 3-Qubit Grover Search on a Programmable Quantum Computer
• Q#: Enabling scalable quantum computing and development with a high-level domain-specific language
• Arbitrarily accurate composite pulses
• The methodology of resonant equiangular composite quantum gates
• A functional quantum programming language
• Quantum Alternation: Prospects and Problems
• Quantum conditional operations
• Circuit Extraction for ZX-diagrams can be #P-hard
• Rise of conditionally clean ancillae for efficient quantum circuit constructions
• A Complete Equational Theory for Quantum Circuits
• Weakly measured while loops: peeking at quantum states
• With a Few Square Roots, Quantum Computing is as Easy as Π
• Axioms for the category of Hilbert spaces and linear contractions
• Join Inverse Rig Categories for Reversible Functional Programming, and Beyond
• Semantics for a Turing-complete Reversible Programming Language with Inductive Types
• Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
• Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
• Towards a Computational Quantum Logic: An Overview of an Ongoing Research Program
• Quantum Recursive Programming with Quantum Case Statements
• Dagger categories of relations: The equivalence of dilatory dagger categories and epi-regular independence categories
• The Zeta Calculus
• Pre-Hilbert $\ast$-categories: The Hilbert-space analogue of abelian categories