Floyd-Hoare logic in iteration theories
Journal of the ACM (JACM)
An axiomatic basis for computer programming
Communications of the ACM
Unconditional security in quantum cryptography
Journal of the ACM (JACM)
Verifying Probabilistic Programs Using a Hoare like Logic
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Towards a quantum programming language
Mathematical Structures in Computer Science
A Functional Quantum Programming Language
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Mathematical Structures in Computer Science
LQP: the dynamic logic of quantum information
Mathematical Structures in Computer Science
Proof rules for the correctness of quantum programs
Theoretical Computer Science
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Reasoning About Imperative Quantum Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
A formal approach to unconditional security proofs for quantum key distribution
UC'11 Proceedings of the 10th international conference on Unconventional computation
| Hi-index | 0.00 |
This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quantum probabilistic programs. Our target programming language is QPL defined by Selinger, and our logic is an extension of the probabilistic Hoare-style logic defined by den Hartog. In this paper, we demonstrate how the quantum Hoare-style logic proves properties of well-known algorithms.