Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation

Abstract

Approximation errors must be taken into account when compiling quantum programs into a low-level gate set. We present a methodology that tracks such errors automatically and then optimizes accuracy parameters to guarantee a specified overall accuracy while aiming to minimize the implementation cost in terms of quantum gates. The core idea of our approach is to extract functions that specify the optimization problem directly from the high-level description of the quantum program. Then, custom compiler passes optimize these functions, turning them into (near-)symbolic expressions for (1) the total error and (2) the implementation cost (e.g., total quantum gate count). All unspecified parameters of the quantum program will show up as variables in these expressions, including accuracy parameters. After solving the corresponding optimization problem, a circuit can be instantiated from the found solution. We develop two prototype implementations, one in C++ based on Clang/LLVM, and another using the Q# compiler infrastructure. We benchmark our prototypes on typical quantum computing programs, including the quantum Fourier transform, quantum phase estimation, and Shor's algorithm.

26 pages

References in corpus (18)

• Quantum cryptography: Public key distribution and coin tossing
• Surface codes: Towards practical large-scale quantum computation
• Supervised learning with quantum enhanced feature spaces
• Advances in Quantum Cryptography
• Quantum computational chemistry
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Hamiltonian Simulation by Qubitization
• Elucidating Reaction Mechanisms on Quantum Computers
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• ProjectQ: An Open Source Software Framework for Quantum Computing
• Q#: Enabling scalable quantum computing and development with a high-level domain-specific language
• Quipper: A Scalable Quantum Programming Language
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
• Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target
• Verified compilation of space-efficient reversible circuits
• Comparing the Overhead of Topological and Concatenated Quantum Error Correction
• Quantitative Robustness Analysis of Quantum Programs (Extended Version)

Cited by in corpus (6)

• Bugs in Quantum Computing Platforms: An Empirical Study
• A Deductive Verification Framework for Circuit-building Quantum Programs
• T-count and T-depth of any multi-qubit unitary
• Enabling Dataflow Optimization for Quantum Programs
• A Practical Quantum Hoare Logic with Classical Variables, I
• Composability of global phase invariant distance and its application to approximation error management