Pith. sign in

Verification of Quantum Circuits through Discrete-Time Barrier Certificates

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

citation-role summary

extension 1

citation-polarity summary

fields

cs.LO 1

years

2025 1

verdicts

CONDITIONAL 1

roles

extension 1

polarities

extend 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.