Programming is error-prone. It is even worse when programming a quantum computer or designing quantum communication protocols, because human intuition is much better adapted to the classical world than to the quantum world. How can we build automatic tools for verifying correctness of quantum programs? A logic for verification of both partial correctness and total correctness of quantum programs was developed in our TOPLAS'2011 paper. The (relative) completeness of this logic was proved. Recently, a theorem prover for verification of quantum programs was built based on this logic [arXiv: 1601.03835]. To further develop automatic tools, we are working on techniques for invariant generation and synthesis of ranking functions for quantum prog...
© 2017 ACM. Program invariant is a fundamental notion widely used in program verification and analys...
We give a new interactive protocol for the verification of quantum computations in the regime of hig...
Abstract. This paper provides a Hoare-style logic for quantum compu-tation. While the usual Hoare lo...
Programming is error-prone. It is even worse when programming a quantum computer or designing quantu...
The field of quantum mechanics predates computer science by at least ten years, the time between the...
Thanks to the rapid progress and growing complexity of quantum algorithms, correctness of quantum pr...
With the rapid development of quantum hardware, people tend to believe that special-purpose quantum ...
Quantum computing is steadily moving from theory into practice, with small-scale quantum computers a...
Technologies based on Quantum Information Processing (QIP) are emerging rapidly in our life, from cr...
© The Author(s) 2019. We formalize the theory of quantum Hoare logic (QHL) [TOPLAS 33(6),19], an ext...
In this talk, I will give an overview of some recent progress and current challenges in the design o...
In support of the growing interest in quantum computing experimentation, programmers need new tools ...
We present a translation from the quantum programming language Quipper to the QPMC model checker, wi...
Quantum programming languages enable developers to implement algorithms for quantum computers that p...
We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a simple lang...
© 2017 ACM. Program invariant is a fundamental notion widely used in program verification and analys...
We give a new interactive protocol for the verification of quantum computations in the regime of hig...
Abstract. This paper provides a Hoare-style logic for quantum compu-tation. While the usual Hoare lo...
Programming is error-prone. It is even worse when programming a quantum computer or designing quantu...
The field of quantum mechanics predates computer science by at least ten years, the time between the...
Thanks to the rapid progress and growing complexity of quantum algorithms, correctness of quantum pr...
With the rapid development of quantum hardware, people tend to believe that special-purpose quantum ...
Quantum computing is steadily moving from theory into practice, with small-scale quantum computers a...
Technologies based on Quantum Information Processing (QIP) are emerging rapidly in our life, from cr...
© The Author(s) 2019. We formalize the theory of quantum Hoare logic (QHL) [TOPLAS 33(6),19], an ext...
In this talk, I will give an overview of some recent progress and current challenges in the design o...
In support of the growing interest in quantum computing experimentation, programmers need new tools ...
We present a translation from the quantum programming language Quipper to the QPMC model checker, wi...
Quantum programming languages enable developers to implement algorithms for quantum computers that p...
We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a simple lang...
© 2017 ACM. Program invariant is a fundamental notion widely used in program verification and analys...
We give a new interactive protocol for the verification of quantum computations in the regime of hig...
Abstract. This paper provides a Hoare-style logic for quantum compu-tation. While the usual Hoare lo...