QWIRE Practice: Formal Verification of Quantum Circuits in Coq
In: Electronic Proceedings in Theoretical Computer Science, Jg. 266 (2018), Heft Proc. QPL 2017, S. 119-132
Online
unknown
Zugriff:
We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving features. The implementation uses higher-order abstract syntax to represent variable binding and provides a type-checking algorithm for linear wire types, ensuring that quantum circuits are well-formed. We formalize a denotational semantics that interprets QWIRE circuits as superoperators on density matrices, and prove the correctness of some simple quantum programs.
Comment: In Proceedings QPL 2017, arXiv:1802.09737
Titel: |
QWIRE Practice: Formal Verification of Quantum Circuits in Coq
|
---|---|
Autor/in / Beteiligte Person: | Paykin, Jennifer ; Rand, Robert ; Zdancewic, Steve |
Link: | |
Zeitschrift: | Electronic Proceedings in Theoretical Computer Science, Jg. 266 (2018), Heft Proc. QPL 2017, S. 119-132 |
Veröffentlichung: | arXiv, 2018 |
Medientyp: | unknown |
DOI: | 10.48550/arxiv.1803.00699 |
Schlagwort: |
|
Sonstiges: |
|