# symQV: Automated Symbolic Verification of Quantum Programs

arXiv: https://arxiv.org/abs/2212.02267 · HTML: https://mlsanity.com/paper/2212.02267/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 5 Dec 2022.

## Built on by (most cited first, 1 of 1)

- [QILP-0: Constructing Observational Declarative Twins of Quantum Circuits](https://mlsanity.com/paper/2609.01049/) (2026)

## Abstract (arXiv)

We present symQV, a symbolic execution framework for writing and verifying quantum computations in the quantum circuit model. symQV can automatically verify that a quantum program complies with a first-order specification. We formally introduce a symbolic quantum program model. This allows to encode the verification problem in an SMT formula, which can then be checked with a delta-complete decision procedure. We also propose an abstraction technique to speed up the verification process. Experimental results show that the abstraction improves symQV's scalability by an order of magnitude to quantum programs with 24 qubits (a 2^24-dimensional state space).