Verification of quantum programs

Publisher:
Elsevier
Publication Type:
Journal Article
Citation:
Science Of Computer Programming, 2013, 78 (9), pp. 1679 - 1700
Issue Date:
2013-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2012006187OK.pdfPublished Version497.29 kB
Adobe PDF
This paper develops verification methodology for quantum programs, and the contribution of the paper is two-fold. Sharir, Pnueli and Hart [M. Sharir, A. Pnueli, S. Hart, Verification of probabilistic programs, SIAM Journal of Computing 13 (1984) 292314] presented a general method for proving properties of probabilistic programs, in which a probabilistic program is modeled by a Markov chain and an assertion on the output distribution is extended to an invariant assertion on all intermediate distributions. Their method is essentially a probabilistic generalization of the classical Floyd inductive assertion method. In this paper, we consider quantum programs modeled by quantum Markov chains which are defined by super-operators. It is shown that the SharirPnueliHart method can be elegantly generalized to quantum programs by exploiting the SchrödingerHeisenberg duality between quantum states and observables. In particular, a completeness theorem for the SharirPnueliHart verification method of quantum programs is established.
Please use this identifier to cite or link to this item: