License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITP.2021.21
URN: urn:nbn:de:0030-drops-139160
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13916/
Hietala, Kesha ;
Rand, Robert ;
Hung, Shih-Han ;
Li, Liyi ;
Hicks, Michael
Proving Quantum Programs Correct
Abstract
As quantum computing progresses steadily from theory into practice, programmers will face a common problem: How can they be sure that their code does what they intend it to do? This paper presents encouraging results in the application of mechanized proof to the domain of quantum programming in the context of the SQIR development. It verifies the correctness of a range of a quantum algorithms including Grover’s algorithm and quantum phase estimation, a key component of Shor’s algorithm. In doing so, it aims to highlight both the successes and challenges of formal verification in the quantum context and motivate the theorem proving community to target quantum computing as an application domain.
BibTeX - Entry
@InProceedings{hietala_et_al:LIPIcs.ITP.2021.21,
author = {Hietala, Kesha and Rand, Robert and Hung, Shih-Han and Li, Liyi and Hicks, Michael},
title = {{Proving Quantum Programs Correct}},
booktitle = {12th International Conference on Interactive Theorem Proving (ITP 2021)},
pages = {21:1--21:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-188-7},
ISSN = {1868-8969},
year = {2021},
volume = {193},
editor = {Cohen, Liron and Kaliszyk, Cezary},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13916},
URN = {urn:nbn:de:0030-drops-139160},
doi = {10.4230/LIPIcs.ITP.2021.21},
annote = {Keywords: Formal Verification, Quantum Computing, Proof Engineering}
}
