REVIEW 1 cited by
Verification of Quantum Circuits through Discrete-Time Barrier Certificates
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 1 Pith paper
-
Verification of Quantum Circuits through Barrier Certificates using a Scenario Approach
A sampling-plus-LP pipeline synthesizes barrier certificates for quantum circuits and SMT-verifies them over continuous state spaces, for finite or infinite horizons with uncertainty.
Discussion (0). Continue with ORCID to comment.