Formal verification of quantum programs: Theory, tools, and challenges

M Lewis, S Soudjani, P Zuliani - ACM Transactions on Quantum …, 2023 - dl.acm.org
Over the past 27 years, quantum computing has seen a huge rise in interest from both
academia and industry. At the current rate, quantum computers are growing in size rapidly …

Coqq: Foundational verification of quantum programs

L Zhou, G Barthe, PY Strub, J Liu, M Ying - Proceedings of the ACM on …, 2023 - dl.acm.org
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 …

[CARTE][B] Foundations of quantum programming

M Ying - 2024 - books.google.com
Quantum computers promise dramatic advantages in processing speed over currently
available computer systems. Quantum computing offers great promise in a wide variety of …

EasyPQC: Verifying post-quantum cryptography

M Barbosa, G Barthe, X Fan, B Grégoire… - Proceedings of the …, 2021 - dl.acm.org
EasyCrypt is a formal verification tool used extensively for formalizing concrete security
proofs of cryptographic constructions. However, the EasyCrypt formal logics consider only …

Proving quantum programs correct

K Hietala, R Rand, SH Hung, L Li, M Hicks - ar** Research Challenges to the Proposed Workflow Model
M Haghparast, T Mikkonen… - 2023 IEEE …, 2023 - ieeexplore.ieee.org
Despite the increasing interest in quantum computing, the aspect of development to achieve
cost-effective and reliable quantum software applications has been slow. One barrier is the …

Automating Equational Proofs in Dirac Notation

Y Xu, G Barthe, L Zhou - Proceedings of the ACM on Programming …, 2025 - dl.acm.org
Dirac notation is widely used in quantum physics and quantum programming languages to
define, compute and reason about quantum states. This paper considers Dirac notation from …

A quantum interpretation of bunched logic & quantum separation logic

L Zhou, G Barthe, J Hsu, M Ying… - 2021 36th Annual ACM …, 2021 - ieeexplore.ieee.org
We propose a model of the substructural logic of Bunched Implications (BI) that is suitable
for reasoning about quantum states. In our model, the separating conjunction of BI describes …

Formal methods for quantum algorithms

C Chareton, D Lee, B Valiron, R Vilmart… - Handbook of Formal …, 2023 - taylorfrancis.com
While the recent progress in quantum hardware opens the door for significant speedup in
cryptography as well as additional key areas (biology, chemistry, optimization, machine …

[HTML][HTML] Automated reasoning

F Portoraro - 2001 - plato.stanford.edu
Reasoning is the ability to make inferences, and automated reasoning is concerned with the
building of computing systems that automate this process. Although the overall goal is to …