symQV: Automated Symbolic Verification of Quantum Programs
Abstract
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).
Cite
@article{arxiv.2212.02267,
title = {symQV: Automated Symbolic Verification of Quantum Programs},
author = {Fabian Bauer-Marquart and Stefan Leue and Christian Schilling},
journal= {arXiv preprint arXiv:2212.02267},
year = {2023}
}
Comments
This is the extended version of a paper with the same title that appeared at FM 2023. Tool available at doi.org/10.5281/zenodo.7400321