Verification of Quantum Programs

@article{Ying2013VerificationOQ,
  title={Verification of Quantum Programs},
  author={Mingsheng Ying and Nengkun Yu and Yuan Feng and Runyao Duan},
  journal={Sci. Comput. Program.},
  year={2013},
  volume={78},
  pages={1679-1700}
}
Invariants of quantum programs: characterisations and generation
TLDR
This paper is the first attempt to define the notion of invariant and to develop a method of invariants generation for quantum programs and shows that the generated invariants can be used to verify correctness of these algorithms and are helpful in optimising quantum Metropolis sampling.
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.
Algorithmic analysis of termination problems for quantum programs
TLDR
This work is essentially a generalisation of constraint-based approach to the corresponding problems for probabilistic programs developed in the recent literature by adding two novel ideas: (1) employing the fundamental Gleason's theorem in quantum mechanics to guide the choices of templates; and (2) a generalised Farkas' lemma in terms of observables in quantum physics.
An Algebraic Method to Fidelity-based Model Checking over Quantum Markov Chains
TLDR
This paper introduces a quantum analogy of computation tree logic (CTL) called QCTL, which concerns fidelity instead of probability in probabilistic CTL, over quantum Markov chains (QMCs), and shows its effectiveness via a quantum IPv4 protocol.
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.
Model checking quantum Markov chains
Model Checking for Verification of Quantum Circuits
  • M. Ying
  • Computer Science, Physics
    FM
  • 2021
In this talk, we will describe a framework for assertion-based verification (ABV) of quantum circuits by applying model checking techniques for quantum systems developed in our previous work, in
Quantum logics for expressing and proving the correctness of quantum programs
TLDR
This thesis is positioned at the interface between quantum logic and quantum computation and contributes to the field in the following four themes: Relating algebraic and spatial quantum structures, abstractions of Hilbert spaces, duality of two different quantum structures and quantum dynamic frames.
Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs
This paper presents a sound axiomatization for a probabilistic modal dynamic logic of quantum programs. The logic can express whether a state is separable or entangled, information that is local to a
Quantum Markov chains: Description of hybrid systems, decidability of equivalence, and model checking linear-time properties
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 55 REFERENCES
A Brief Survey of Quantum Programming Languages
This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its beginnings in 1982, when Paul
Quantum loop programs
TLDR
A general scheme of quantum loops is introduced and a denotational semantics and a weakest precondition semantics of a quantum loop are given, and the notions of termination and almost termination are proposed for quantum loops in the case of finite-dimensional state spaces.
Model checking quantum Markov chains
LQP: the dynamic logic of quantum information
  • A. Baltag, S. Smets
  • Computer Science, Physics
    Mathematical Structures in Computer Science
  • 2006
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.
Proof rules for purely quantum programs
AbstractWe apply the notion of quantumpredicate proposed by D’Hondt and Panangaden to analyzea purely quantum language fragment which describes the quantum part of a future quantumcomputer in Knill’s
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.
Floyd--hoare logic for quantum programs
TLDR
It is proved that this logic is (relatively) complete by exploiting the power of weakest precond conditions and weakest liberal preconditions for quantum programs.
Defining Quantum Control Flow
TLDR
A general quantum control structure is introduced by defining three new quantum program constructs, namely quantum guarded command, quantum choice and quantum recursion, and the relation between quantum choices and probabilistic choices is clarified.
Quantum Markov chains
A new approach to quantum Markov chains is presented. We first define a transition operation matrix (TOM) as a matrix whose entries are completely positive maps whose column sums form a quantum
...
1
2
3
4
5
...