Toward Automatic Verification of Quantum Programs

07/31/2018
by   Mingsheng Ying, et al.
0

This paper summarises the results obtained by the author and his collaborators in a program logic approach to the verification of quantum programs, including quantum Hoare logic, invariant generation and termination analysis for quantum programs. It also introduces the notion of proof outline and several auxiliary rules for more conveniently reasoning about quantum programs. Some problems for future research are proposed at the end of the paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2019

Coupling Techniques for Reasoning about Quantum Programs

Relational verification of quantum programs has many potential applicati...
research
02/15/2023

Verification of Nondeterministic Quantum Programs

Nondeterministic choice is a useful program construct that provides a wa...
research
07/22/2022

CoqQ: Foundational Verification of Quantum Programs

CoqQ is a framework for reasoning about quantum programs in the Coq proo...
research
11/11/2022

Quantum Natural Proof: A New Perspective of Hybrid Quantum-Classical Program Verification

Many quantum programs are assured by formal verification, but such verif...
research
10/26/2018

Reasoning about Parallel Quantum Programs

We initiate the study of parallel quantum programming by defining the op...
research
10/04/2021

Formal Verification of Quantum Programs: Theory, Tools and Challenges

Over the past 27 years, quantum computing has seen a huge rise in intere...
research
04/13/2021

Gleipnir: Toward Practical Error Analysis for Quantum Programs (Extended Version)

Practical error analysis is essential for the design, optimization, and ...

Please sign up or login with your details

Forgot password? Click here to reset