Close

Presentation

Approximate Equivalence Checking of Noisy Quantum Circuits
Time
Location
Event Type
Research Manuscript
Virtual Programs
Hosted in Virtual Platform
Keywords
Design Verification and Validation
Topics
EDA
DescriptionWe study the fundamental design automation problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelity which measures the average distance between output states of two super-operators when the input is chosen at random. By employing tensor network contraction, we present two algorithms for computing the fidelity between an ideal quantum circuit and its noisy implementations. The effectiveness of our algorithms is demonstrated by experimenting on benchmarks of real NISQ circuits.