Toward automatic verification of quantum programs

13Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Ying, M. (2019). Toward automatic verification of quantum programs. Formal Aspects of Computing, 31(1), 3–25. https://doi.org/10.1007/s00165-018-0465-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free