Year: 2021
Type: preprint
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 $(\hatρ,δ)$-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state $\hatρ$ and its distance $δ$ to the ideal state $ρ$. This predicate $(\hatρ,δ)$ 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 $(\hatρ,δ)$-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.
Source: arXiv (Cornell University)
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: PFCQC: STAQ: Software-Tailored Architecture for Quantum co-design, FMitF: Track I: A Secure and Verifiable Commodity Hypervisor, SaTC: CORE: Medium: Microverification of Information-Flow Security for the Linux Operating System Kernel, TOUGH ERRORS ARE NO MATCH (TEAM): OPTIMIZING THE QUANTUM COMPILER FOR NOISE RESILIENCE, QLCI-CI: NSF Quantum Leap Challenge Institute for Hybrid Quantum Architectures and Networks, Collaborative Research: EPiQC: Enabling Practical-Scale Quantum Computation
OpenAlex ID: W3155906867