© 2018, British Computer Society. 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
In support of the growing interest in quantum computing experimentation, programmers need new tools ...
In this talk, I will give an overview of some recent progress and current challenges in the design o...
International audienceThis paper presents a formal framework for semi-automated verification of secu...
Programming is error-prone. It is even worse when programming a quantum computer or designing quantu...
© The Author(s) 2019. We formalize the theory of quantum Hoare logic (QHL) [TOPLAS 33(6),19], an ext...
Abstract. This paper provides a Hoare-style logic for quantum compu-tation. While the usual Hoare lo...
With the rapid development of quantum hardware, people tend to believe that special-purpose quantum ...
Hoare logic provides a syntax-oriented method to reason about program correctness and has been prove...
AbstractA logic for reasoning about states of basic quantum imperative programs is presented. The mo...
We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a simple lang...
The field of quantum mechanics predates computer science by at least ten years, the time between the...
This chapter introduces both the requirements and challenges for an efficient use of formal methods ...
© 2017 ACM. Program invariant is a fundamental notion widely used in program verification and analys...
Quantum Hoare Logic (QHL) was introduced in Ying's work to specify and reason about quantum programs...
Thanks to the rapid progress and growing complexity of quantum algorithms, correctness of quantum pr...
In support of the growing interest in quantum computing experimentation, programmers need new tools ...
In this talk, I will give an overview of some recent progress and current challenges in the design o...
International audienceThis paper presents a formal framework for semi-automated verification of secu...
Programming is error-prone. It is even worse when programming a quantum computer or designing quantu...
© The Author(s) 2019. We formalize the theory of quantum Hoare logic (QHL) [TOPLAS 33(6),19], an ext...
Abstract. This paper provides a Hoare-style logic for quantum compu-tation. While the usual Hoare lo...
With the rapid development of quantum hardware, people tend to believe that special-purpose quantum ...
Hoare logic provides a syntax-oriented method to reason about program correctness and has been prove...
AbstractA logic for reasoning about states of basic quantum imperative programs is presented. The mo...
We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a simple lang...
The field of quantum mechanics predates computer science by at least ten years, the time between the...
This chapter introduces both the requirements and challenges for an efficient use of formal methods ...
© 2017 ACM. Program invariant is a fundamental notion widely used in program verification and analys...
Quantum Hoare Logic (QHL) was introduced in Ying's work to specify and reason about quantum programs...
Thanks to the rapid progress and growing complexity of quantum algorithms, correctness of quantum pr...
In support of the growing interest in quantum computing experimentation, programmers need new tools ...
In this talk, I will give an overview of some recent progress and current challenges in the design o...
International audienceThis paper presents a formal framework for semi-automated verification of secu...