A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Verification of sequential and concurrent programs (2nd ed.)
Verification of sequential and concurrent programs (2nd ed.)
Quantum computation and quantum information
Quantum computation and quantum information
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Toward a quantum process algebra
Proceedings of the 1st conference on Computing frontiers
Towards a quantum programming language
Mathematical Structures in Computer Science
Communicating quantum processes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
Proof rules for the correctness of quantum programs
Theoretical Computer Science
An algebra of quantum processes
ACM Transactions on Computational Logic (TOCL)
Reasoning About Imperative Quantum Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation for quantum processes
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reachability and termination analysis of concurrent quantum programs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Reachability probabilities of quantum markov chains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
PRINSYS: on a quest for probabilistic loop invariants
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Hi-index | 0.00 |
Floyd--Hoare logic is a foundation of axiomatic semantics of classical programs, and it provides effective proof techniques for reasoning about correctness of classical programs. To offer similar techniques for quantum program verification and to build a logical foundation of programming methodology for quantum computers, we develop a full-fledged Floyd--Hoare logic for both partial and total correctness of quantum programs. It is proved that this logic is (relatively) complete by exploiting the power of weakest preconditions and weakest liberal preconditions for quantum programs.