Gleipnir - toward practical error analysis for Quantum programs
At a Glance
Section titled āAt a Glanceā| Metadata | Details |
|---|---|
| Publication Date | 2021-06-18 |
| Authors | Runzhou Tao, Yunong Shi, Jianan Yao, John Hui, Frederic T. Chong |
| Institutions | University of Chicago, Columbia University |
| Citations | 13 |
Abstract
Section titled ā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. Furthermore, 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.