Gleipnir: Toward Practical Error Analysis for Quantum Programs (Extended Version)

04/13/2021
by   Runzhou Tao, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset