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

page 1

page 2

page 3

page 4

research
11/08/2018

Quantitative Robustness Analysis of Quantum Programs (Extended Version)

Quantum computation is a topic of significant recent interest, with prac...
research
07/31/2018

Toward Automatic Verification of Quantum Programs

This paper summarises the results obtained by the author and his collabo...
research
04/18/2019

Optimizing Quantum Programs against Decoherence: Delaying Qubits into Quantum Superposition

Quantum computing technology has reached a second renaissance in the las...
research
12/20/2020

Physical Implementability of Quantum Maps and Its Application in Error Mitigation

Completely positive and trace-preserving maps characterize physically im...
research
09/06/2021

Gottesman Types for Quantum Programs

The Heisenberg representation of quantum operators provides a powerful t...
research
10/13/2021

Algebraic Reasoning of Quantum Programs via Non-Idempotent Kleene Algebra

We investigate the algebraic reasoning of quantum programs inspired by t...
research
06/20/2023

Pseudorandom unitaries are neither real nor sparse nor noise-robust

Pseudorandom quantum states (PRSs) and pseudorandom unitaries (PRUs) pos...

Please sign up or login with your details

Forgot password? Click here to reset