Publication Details

AutoQ: An Automata-based Quantum Circuit Verifier

LENGÁL, O.; CHEN, Y.; TSAI, W.; CHUNG, K.; LIN, J. AutoQ: An Automata-based Quantum Circuit Verifier. In Proceedings of 35th International Conference on Computer Aided Verification. Lecture Notes in Computer Science. Cham: Springer Verlag, 2023. p. 139-153. ISSN: 0302-9743.
Czech title
AutoQ: verifikátor kvantových obvodů založený na automatech
Type
conference paper
Language
English
Authors
Lengál Ondřej, Ing., Ph.D. (DITS)
Chen Yu-Fang
TSAI, W.
CHUNG, K.
LIN, J.
Keywords

quantum circuits, verification, tree automata, symbolic execution

Abstract

We present a specification language and a fully automated tool named AutoQ for verifying quantum circuits symbolically. The tool implements the automata-based algorithm from [Chen et al. 2023] and extends it with the capabilities for symbolic reasoning. The extension allows to specify relational properties, i.e., relationships between states before and after executing a circuit. We present a number of use cases where we used AutoQ to fully automatically verify crucial properties of several quantum circuits, which have, to the best of our knowledge, so far been proved only with human help.

Published
2023
Pages
139–153
Journal
Lecture Notes in Computer Science, no. 13966, ISSN 0302-9743
Proceedings
Proceedings of 35th International Conference on Computer Aided Verification
Publisher
Springer Verlag
Place
Cham
DOI
10.1007/978-3-031-37709-9_7
EID Scopus
2-s2.0-85169429472
BibTeX 
@inproceedings{BUT185179,
  author="LENGÁL, O. and CHEN, Y. and TSAI, W. and CHUNG, K. and LIN, J.",
  title="AutoQ: An Automata-based Quantum Circuit Verifier",
  booktitle="Proceedings of 35th International Conference on Computer Aided Verification",
  year="2023",
  journal="Lecture Notes in Computer Science",
  number="13966",
  pages="139--153",
  publisher="Springer Verlag",
  address="Cham",
  doi="10.1007/978-3-031-37709-9\{_}7",
  issn="0302-9743"
}
Back to top