CoqQ: Foundational Verification of Quantum Programs-Reference-Cited by-同舟云学术

CoqQ: Foundational Verification of Quantum Programs

Published:2023-01-09 Issue:POPL Volume:7 Page:833-865
ISSN:2475-1421
Container-title:Proceedings of the ACM on Programming Languages
language:en
Short-container-title:Proc. ACM Program. Lang.

Author:

Zhou Li¹^ORCID,Barthe Gilles²^ORCID,Strub Pierre-Yves³^ORCID,Liu Junyi⁴^ORCID,Ying Mingsheng⁵^ORCID

Affiliation:

1. MPI-SP, Germany / Institute of Software at Chinese Academy of Sciences, China

2. MPI-SP, Germany / IMDEA Software Institute, Spain

3. Meta, France

4. Institute of Software at Chinese Academy of Sciences, China / University of Chinese Academy of Sciences, China

5. Institute of Software at Chinese Academy of Sciences, China / Tsinghua University, China

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3571222

Reference77 articles.

1. Samson Abramsky and Bob Coecke . 2009. Categorical quantum mechanics. Handbook of quantum logic and quantum structures, 2 ( 2009 ), 261–325. Samson Abramsky and Bob Coecke. 2009. Categorical quantum mechanics. Handbook of quantum logic and quantum structures, 2 (2009), 261–325.

2. Dmitri Akatov . 2005. The Logic of Quantum Program Verification. Master’s thesis . Oxford University Computing Laboratory . Dmitri Akatov. 2005. The Logic of Quantum Program Verification. Master’s thesis. Oxford University Computing Laboratory.

3. Towards Large-scale Functional Verification of Universal Quantum Circuits

4. Andrew W Appel . 2011 . Verified software toolchain . In European Symposium on Programming. 1–17 . Andrew W Appel. 2011. Verified software toolchain. In European Symposium on Programming. 1–17.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dynamic Transitive Closure-Based Static Analysis through the Lens of Quantum Search;ACM Transactions on Software Engineering and Methodology;2024-02-05

2. Local Reasoning About Probabilistic Behaviour for Classical–Quantum Programs;Lecture Notes in Computer Science;2023-12-30

3. Formal Verification of Quantum Programs: Theory, Tools, and Challenges;ACM Transactions on Quantum Computing;2023-12-16

4. A Testing Pipeline for Quantum Computing Applications;2023 IEEE International Conference on Quantum Software (QSW);2023-07