Verification of Quantum Circuits through Discrete-Time Barrier Certificates
Marco Lewis, Sadegh Soudjani, Paolo Zuliani

TL;DR
This paper introduces a novel method for verifying quantum circuits by extending barrier certificates with Hermitian Sum of Squares optimization, leveraging dynamical systems verification techniques.
Contribution
It proposes k-inductive barrier certificates for quantum circuits and demonstrates their computation and application for property verification.
Findings
Successfully verified properties of various quantum circuits
Extended barrier certificates to complex variables for quantum systems
Demonstrated effectiveness of Hermitian Sum of Squares in quantum verification
Abstract
Current methods for verifying quantum computers are predominately based on interactive or automatic theorem provers. Considering that quantum computers are dynamical in nature, this paper employs and extends the concepts from the verification of dynamical systems to verify properties of quantum circuits. Our main contribution is to propose k-inductive barrier certificates over complex variables and show how to compute them using Hermitian Sum of Squares optimization. We apply this new technique to verify properties of different quantum circuits.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVLSI and Analog Circuit Testing · Quantum Computing Algorithms and Architecture · Low-power high-performance VLSI design
