Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Elsevier eBooks

Verification of quantum programs

Mingsheng Ying

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1016/b978-0-44-315942-8.00018-6

Related papers

Verification of quantum programs

Mingsheng Ying, Nengkun Yu, Yuan Feng +1 more

arXiv:1106.4063•Science of Computer Programming•Apr 16, 2013•57 citations

Automated Quantum Program Verification in Dynamic Quantum Logic

Tsubasa Takagi, Canh Minh Do, Kazuhiro Ogata

Lecture notes in computer science•Jan 1, 2024•11 citations

A Logic for Formal Verification of Quantum Programs

Yoshihiko Kakutani

Lecture notes in computer science•Jan 1, 2009•53 citations

Verification of Quantum Processes in a Functional Based Programming Language

Anthony Hoover

Bulletin of the American Physical Society•Mar 3, 2014•0 citations

Embedding Quantum Program Verification into Dafny

Feifei Cheng, Sushen Vallabh Vangeepuram, Henry Allard +3 more

Despite recent development of quantum program verification, it is still in its early stage, where many quantum programs are hard to verify due to their inherent probabilistic nature and parallelism in quantum superposition. We propose Qafny c , a system that compiles quantum program verification into a well-established classical program verifier Dafny, enabling the formal verification of quantum programs. The key insight behind Qafny c is the separation of quantum program verification from its execution, leveraging the strength of classical verifiers to ensure correctness before compiling certified quantum programs into executable circuits. Using Qafny c , we have successfully verified 37 diverse quantum programs by compiling their verification into Dafny. To the best of our knowledge, this is the most extensive formally verified set of quantum programs.

Proceedings of the ACM on Programming Languages•Oct 9, 2025•6 citations

Dynamic Program Verification with Quantum Algorithm Acceleration

Jincheng Zhang

This paper investigates the application of quantum algorithms to accelerate dynamic program verification (DPV). Dynamic program verification is a computationally intensive process often employed in software verification and formal methods. The core claim presented here is that leveraging quantum algorithms can significantly enhance the efficiency and security of DPV, potentially uncovering vulnerabilities that traditional algorithms might miss. The proposed mechanism involves formulating the DPV problem as a quantum algorithm problem, enabling the utilization of quantum computers for efficient solution. This research explores the theoretical framework and potential impact of such a hybrid approach. Specifically, we examine how quantum superposition and entanglement can be exploited to explore multiple states of the program simultaneously, leading to a faster verification process. The paper details the transformation of DPV state spaces into quantum state spaces and discusses the challenges associated with mapping the computational complexity of DPV onto the capabilities of current and near-term quantum hardware. We conclude by outlining future research directions and the potential for a paradigm shift in software verification.

•Sep 3, 2026•0 citations
Despite recent development of quantum program verification, it is still in its early stage, where many quantum programs are hard to verify due to their inherent probabilistic nature and parallelism in quantum superposition. We propose Qafny c , a system that compiles quantum program verification into a well-established classical program verifier Dafny, enabling the formal verification of quantum programs. The key insight behind Qafny c is the separation of quantum program verification from its execution, leveraging the strength of classical verifiers to ensure correctness before compiling certified quantum programs into executable circuits. Using Qafny c , we have successfully verified 37 diverse quantum programs by compiling their verification into Dafny. To the best of our knowledge, this is the most extensive formally verified set of quantum programs.
This paper investigates the application of quantum algorithms to accelerate dynamic program verification (DPV). Dynamic program verification is a computationally intensive process often employed in software verification and formal methods. The core claim presented here is that leveraging quantum algorithms can significantly enhance the efficiency and security of DPV, potentially uncovering vulnerabilities that traditional algorithms might miss. The proposed mechanism involves formulating the DPV problem as a quantum algorithm problem, enabling the utilization of quantum computers for efficient solution. This research explores the theoretical framework and potential impact of such a hybrid approach. Specifically, we examine how quantum superposition and entanglement can be exploited to explore multiple states of the program simultaneously, leading to a faster verification process. The paper details the transformation of DPV state spaces into quantum state spaces and discusses the challenges associated with mapping the computational complexity of DPV onto the capabilities of current and near-term quantum hardware. We conclude by outlining future research directions and the potential for a paradigm shift in software verification.