Gleipnir: Toward Practical Error Analysis for Quantum Programs (Extended Version)
arXiv:2104.06349
Abstract
Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the -diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state and its distance to the ideal state . This predicate can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the -diamond norm metric. Our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.
typos corrected
References in corpus (11)
- Surface codes: Towards practical large-scale quantum computation
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- A Quantum Approximate Optimization Algorithm
- A class of quantum many-body states that can be efficiently simulated
- Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
- Application of a resource theory for magic states to fault-tolerant quantum computing
- ScaffCC: Scalable Compilation and Analysis of Quantum Programs
- Quantum MERA Channels
- TensorNetwork for Machine Learning
- Approximation of real error channels by Clifford channels and Pauli measurements
- Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers