Floyd--hoare logic for quantum programs

@article{Ying2012FloydhoareLF,
  title={Floyd--hoare logic for quantum programs},
  author={Mingsheng Ying},
  journal={ACM Trans. Program. Lang. Syst.},
  year={2012},
  volume={33},
  pages={19:1-19:49}
}
  • M. Ying
  • Published 1 December 2011
  • Computer Science
  • ACM Trans. Program. Lang. Syst.
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… 

Figures from this paper

Verification Logics for Quantum Programs
TLDR
The mathematical foundations of the Hoare logics, their underlying languages, and the expressivity of their assertions are compared; the languages used are used to verify the Deutsch-Jozsa Algorithm, and their relative usability in practice is discussed.
Logic for quantum programs
Quantum Hoare Logic
TLDR
This work specifies the syntax and denotational semantics of a simple model of quantum programs and writes down the rules of quantum Hoare logic for partial correctness, and shows the soundness and completeness of the resulting proof system.
Formal Verification of Quantum Algorithms Using Quantum Hoare Logic
TLDR
To the best knowledge, this is the first time a Hoare logic for quantum programs is formalized in an interactive theorem prover, and used to verify the correctness of a nontrivial quantum algorithm.
Quantum Hoare logic with classical variables
TLDR
A quantum Hoare logic for a simple while language that involves both classical and quantum variables is proposed and its soundness and relative completeness are proven for both partial and total correctness of quantum programs written in the language.
An applied quantum Hoare logic
We derive a variant of quantum Hoare logic (QHL), called applied quantum Hoare logic (aQHL for short), by: 1. restricting QHL to a special class of preconditions and postconditions, namely
Quantum Hoare Type Theory
TLDR
Inspired by Hoare Type Theory in classical computing, Quantum Hoar Type Theory (QHTT) is proposed in which precise specifications about the modification to the quantum state can be provided within the type of a computation.
A Theorem Prover for Quantum Hoare Logic and Its Applications
TLDR
This paper implements a theorem prover for QHL based on Isabelle/HOL, and proves the correctness of two well-known quantum algorithms, i.e., Grover Quantum Search and Quantum Phase Estimation are proved using the theoremProver, the first mechanized proofs for both of them.
A Quantum interpretation of separating conjunction for local reasoning of Quantum programs based on separation logic
TLDR
A Hoare-style inference framework is proposed that supports local reasoning for quantum programs and provides a quantum interpretation of the separating conjunction to infuse separation logic into this framework and apply local reasoning using a quantum frame rule that is similar to the classical frame rule.
A Logic for Recursive Quantum Programs
TLDR
This paper presents a logic for recursive quantum programs, an extension of quantum Hoare logic for quantum While-programs, and its effectiveness is shown by a running example: fixed-point Grover's search.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 47 REFERENCES
Proof rules for the correctness of quantum programs
Reasoning About Imperative Quantum Programs
Quantum weakest preconditions
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between the usual
Quantum Programming
TLDR
The theory of quantum programming provides tools to write both classical and quantum specifications, develop quantum programs that implement these specifications, and reason about their comparative time and space complexity all in the same framework.
Towards a quantum programming language
  • P. Selinger
  • Computer Science
    Mathematical Structures in Computer Science
  • 2004
TLDR
This paper describes the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types, and has an interesting denotational semantics in terms of complete partial orders of superoperators.
A functional quantum programming language
  • Jonathan Grattage
  • Computer Science
    20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
  • 2005
TLDR
QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings explicit, and preserves superpositions and entanglement -which is essential for quantum parallelism.
LQP: the dynamic logic of quantum information
TLDR
A dynamic logic formalism for reasoning about information flow in composite quantum systems, capable of expressing important features of quantum measurements and unitary evolutions of multi-partite states, as well as giving logical characterisations to various forms of entanglement.
Dynamic Quantum Logic for Quantum Programs
TLDR
A way to apply quantum logic to the study of quantum programs is presented by using an extension of the usual propositional language in order to make transformations performed on the system appear explicitly.
Soundness and Completeness of an Axiom System for Program Verification
  • S. Cook
  • Computer Science
    SIAM J. Comput.
  • 1978
TLDR
The main new results are the completeness theorem, and a careful treatment of the procedure call rules for procedures with global variables in their declarations.
Reachability and Termination Analysis of Concurrent Quantum Programs
We introduce a Markov chain model of concurrent quantum programs. This model is a quantum generalization of Hart, Sharir and Pnueli's probabilistic concurrent programs. Some characterizations of the
...
1
2
3
4
5
...