Floyd--hoare logic for quantum programs
Top Cited Papers
Open Access
- 1 December 2011
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 33 (6) , 1-49
Abstract
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.Keywords
All Related Versions
Funding Information
- Australian Research Council (DP110103473)
- National Natural Science Foundation of China (60736011)
This publication has 17 references indexed in Scilit:
- Bisimulation for quantum processes2011
- Proof rules for the correctness of quantum programsTheoretical Computer Science, 2007
- Quantum programming languages: survey and bibliographyMathematical Structures in Computer Science, 2006
- LQP: the dynamic logic of quantum informationMathematical Structures in Computer Science, 2006
- Quantum weakest preconditionsMathematical Structures in Computer Science, 2006
- Reasoning About Imperative Quantum ProgramsElectronic Notes in Theoretical Computer Science, 2006
- A Functional Quantum Programming Language2005
- DYNAMIC QUANTUM LOGIC FOR QUANTUM PROGRAMSInternational Journal of Quantum Information, 2004
- Verification of Sequential and Concurrent Programs1997
- The Logic of Quantum MechanicsAnnals of Mathematics, 1936