Book contents
- Frontmatter
- Contents
- Contributors
- Preface
- 1 No-Cloning in Categorical Quantum Mechanics
- 2 Classical and Quantum Structuralism
- 3 Generalized Proof-Nets for Compact Categories with Biproducts
- 4 Quantum Lambda Calculus
- 5 The Quantum IO Monad
- 6 Abstract Interpretation Techniques for Quantum Computation
- 7 Extended Measurement Calculus
- 8 Predicate Transformer Semantics of Quantum Programs
- 9 The Structure of Partial Isometries
- 10 Temporal Logics for Reasoning about Quantum Systems
- 11 Specification and Verification of Quantum Protocols
- Index
- References
8 - Predicate Transformer Semantics of Quantum Programs
Published online by Cambridge University Press: 05 July 2014
Book contents
- Frontmatter
- Contents
- Contributors
- Preface
- 1 No-Cloning in Categorical Quantum Mechanics
- 2 Classical and Quantum Structuralism
- 3 Generalized Proof-Nets for Compact Categories with Biproducts
- 4 Quantum Lambda Calculus
- 5 The Quantum IO Monad
- 6 Abstract Interpretation Techniques for Quantum Computation
- 7 Extended Measurement Calculus
- 8 Predicate Transformer Semantics of Quantum Programs
- 9 The Structure of Partial Isometries
- 10 Temporal Logics for Reasoning about Quantum Systems
- 11 Specification and Verification of Quantum Protocols
- Index
- References
Summary
Abstract
This chapter presents a systematic exposition of predicate transformer semantics for quantum programs. It is divided into two parts: The first part reviews the state transformer (forward) semantics of quantum programs according to Selinger's suggestion of representing quantum programs by superoperators and elucidates D'Hondt-Panangaden's theory of quantum weakest preconditions in detail. In the second part, we develop a quite complete predicate transformer semantics of quantum programs based on Birkhoff-von Neumann quantum logic by considering only quantum predicates expressed by projection operators. In particular, the universal conjunctivity and termination law of quantum programs are proved, and Hoare's induction rule is established in the quantum setting.
8.1 Introduction
In the mid-1990s Shor and Grover discovered, respectively, the famous quantum factoring and searching algorithms. Their discoveries indicated that in principle quantum computers offer a way to accomplish certain computational tasks much more efficiently than classical computers, and thus stimulated an intensive investigation in quantum computation. Since then a substantial effort has been made to develop the theory of quantum computation, to find new quantum algorithms, and to exploit the physical techniques needed in building functional quantum computers, including in particular fault tolerance techniques.
Currently, quantum algorithms are expressed mainly at the very low level of quantum circuits. In the history of classical computation, however, it was realized long time ago that programming languages provide a technique that allows us to think about a problem that we intend to solve in a high-level, conceptual way, rather than the details of implementation.
Information
- Type
- Chapter
- Information
- Semantic Techniques in Quantum Computation , pp. 311 - 360Publisher: Cambridge University PressPrint publication year: 2009
References
, and (1936) The logic of quantum mechanics. Annals of Mathematics 37:823–843.CrossRefGoogle Scholar
, and (2000) Algebraic aspects of orthomodular lattices. In , , and , editors, Current Research in Operational Quantum Logic: Algebras, Categories, Languages, pages 37–65. Kluwer.Google Scholar
, and (1999) Reasoning about grover's quantum search algorithms using probabilistic wp. ACM Transactions on Programming Languages and Systems 21:417–130.CrossRefGoogle Scholar
, and (2006) Quantum weakest preconditions. Mathematical Structures in Computer Science 16:429–451.CrossRefGoogle Scholar
, , , and (2007) Proof rules for correctness of quantum programs. Theoretical Computer Science 386:151–166.CrossRefGoogle Scholar
(2006) Quantum programming languages: survey and bibliography. Mathematical Structures in Computer Science 16:581–600.CrossRefGoogle Scholar
(1996) Lattice properties of quantum effects. Journal of Mathematical Physics 37:2637-2642.CrossRefGoogle Scholar
(1992) Programs, Recursion and Unbounded Choice: Predicate-Transformation Semantics and Transformation Rules. Cambridge University Press.CrossRefGoogle Scholar
(1971) Procedures and parameters: an axiomatic approach. In , editor, Symposium on Semantics of Algorithmic Languages, pages 102–116. Lecture Notes in Mathematics 188, Springer-Verlag.Google Scholar
(1951) Order properties of bounded self-adjoint operators. Proceedings of American Mathical Society 34:505–510.Google Scholar
(1996) Conventions for quantum pseudocode. Technical Report LAUR-96-2724, Los Alamos National Laboratory.CrossRefGoogle Scholar
(1981) Semantics of probabilistic programs. Journal of Computer and System Sciences 22:328-350.CrossRefGoogle Scholar
(1983) States, Effects and Operations: Fundamental Notions of Quantum Theory. Springer-Verlag.CrossRefGoogle Scholar
, , and (1996) Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems 18:325–353.CrossRefGoogle Scholar
(1967) Commutation Properties of Hilbert Space Operators and Related Topics. Springer-Verlag.CrossRefGoogle Scholar
, and (2000) Quantum programming. In Proceedings of Mathematics of Program Construction 2000, pages 80–99. LNCS 1837.Google Scholar
(1970) Outline of a mathematical theory of computation. In Proceedings of 4th Annual Princeton Conference on Information Sciences and Systems, pages 169–176.Google Scholar
(2004) Towards a quantum programming language. Mathematical Structures in Computer Science 14:527–586.CrossRefGoogle Scholar
(1981) Quantum set theory. In , and , editors, Current Issues in Quantum Logics, pages 303–322. Plenum.Google Scholar
(2000) Automata theory based on quantum logic (i), (ii). International Journal of Theoretical Physics 39:985-995; 2545-2557.Google Scholar
(2005) A theory of computation based on quantum logic (i). Theoretical Computer Science 344:134–207.CrossRefGoogle Scholar
(2007) Quantum logic and automata theory. In , , and , editors, Handbook of Quantum Logic and Quantum Structures, pages 619–754. Elsevier.Google Scholar
, , , and (2007) Commputativity of quantum weakest preconditions. Information Processing Letters 104:152–158.CrossRefGoogle Scholar
(2004) Non-deterministic quantum programming. In , editor, Proceedings of the 2nd International Workshop on Quantum Programming Languages, pages 179–195. TUCS General Publication No 33, Turku Centre for Computer Science, Turku, Finland.Google Scholar
Accessibility standard: Unknown
Why this information is here
This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.Accessibility Information
Accessibility compliance for the PDF of this chapter is currently unknown
and may be updated in the future.
- 7
- Cited by