CoqQ: Foundational Verification of Quantum Programs
- Publisher:
- ASSOC COMPUTING MACHINERY
- Publication Type:
- Journal Article
- Citation:
- Proceedings of the ACM on Programming Languages, 2023, 7, (POPL), pp. 833-865
- Issue Date:
- 2023-01-09
Open Access
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
CoqQ is a framework for reasoning about quantum programs in the Coq proof assistant. Its main components are: a deeply embedded quantum programming language, in which classic quantum algorithms are easily expressed, and an expressive program logic for proving properties of programs. CoqQ is foundational: the program logic is formally proved sound with respect to a denotational semantics based on state-of-art mathematical libraries (MathComp and MathComp Analysis). CoqQ is also practical: assertions can use Dirac expressions, which eases concise specifications, and proofs can exploit local and parallel reasoning, which minimizes verification effort. We illustrate the applicability of CoqQ with many examples from the literature.
Please use this identifier to cite or link to this item: