Abstract
This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quantum probabilistic programs. Our target programming language is QPL defined by Selinger, and our logic is an extension of the probabilistic Hoare-style logic defined by den Hartog. In this paper, we demonstrate how the quantum Hoare-style logic proves properties of well-known algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of ACM 12, 576–580 (1969)
Cook, S.A.: Soundness and completeness of an axiom system for program verification. SIAM Journal on Computing 7(1), 70–78 (1978)
Harel, D., Kozen, D., Tiuryn, J.: Dynamic logic. In: Handbook of Philosophical Logic, pp. 497–604. MIT Press, Cambridge (1984)
Selinger, P.: Towards a quantum programming language. Mathematical Structures in Computer Science 14(4), 527–586 (2004)
den Hartog, J.I.: Verifying probabilistic programs using a Hoare-like logic. In: Thiagarajan, P.S., Yap, R.H.C. (eds.) ASIAN 1999. LNCS, vol. 1742, pp. 113–125. Springer, Heidelberg (1999)
Bennet, C.H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein-Podolski-Rosen channels. Physical Review Letters 70, 1895–1899 (1993)
Shor, P.W.: Algorithms for quantum computation. In: Foundations of Computer Science, pp. 124–134. IEEE Computer Society Press, Los Alamitos (1994)
Cleve, R., Ekert, A.K., Macchiavello, C., Mosca, M.: Quantum algorithms revised. Proceedings of Royal Society London A 454, 339–354 (1998)
Bennet, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Computers, Systems and Signal Processing, pp. 175–179. IEEE Computer Society, Los Alamitos (1984)
Baltag, A., Smets, S.: LQP: the dynamic logic of quantum information. Mathematical Structures in Computer Science 16(3), 491–525 (2006)
Brunet, O., Jorrand, P.: Dynamic quantum logic for quantum programs. International Journal of Quantum Information 2(1) (2004)
Chadha, R., Mateus, P., Sernadas, A.: Reasoning about imperative quantum programs. In: Mathematical Foundations of Programming Semantics. ENTCS, vol. 158, pp. 19–39. Elsevier, Amsterdam (2006)
D’Hondt, E., Panangaden, P.: Quantum weakest preconditions. Mathematical Structures in Computer Science 16(3), 429–451 (2006)
Ying, M.S.: Hoare logic for quantum programs (2009) arXiv:0906.4586v1
Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of Royal Society London A 400, 97–117 (1985)
Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proceedings of Royal Society London A 439, 553–558 (1992)
Mayers, D.: Unconditional security in quantum cryptography. Journal of ACM 48(3), 351–406 (2001)
Feng, Y., Duan, R.Y., Ji, Z.F., Ying, M.S.: Proof rules for the correctness of quantum programs. Theoretical Computer Science 386(1,2), 151–166 (2007)
Altenkirch, T., Grattage, J.: A functional quantum programming language. In: Logic in Computer Science, pp. 249–258. IEEE Computer Society, Los Alamitos (2005)
Floyd, R.W.: Assigning meanings to programs. In: Applied Mathematics, AMS, pp. 19–32 (1967)
Bloom, S., Ésik, Z.: Floyd-Hoare logic in iteration theories. Journal of ACM 38(4), 887–934 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kakutani, Y. (2009). A Logic for Formal Verification of Quantum Programs. In: Datta, A. (eds) Advances in Computer Science - ASIAN 2009. Information Security and Privacy. ASIAN 2009. Lecture Notes in Computer Science, vol 5913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10622-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-10622-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10621-7
Online ISBN: 978-3-642-10622-4
eBook Packages: Computer ScienceComputer Science (R0)