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
4 - Quantum Lambda Calculus
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
We discuss the design of a typed lambda calculus for quantum computation. After a brief discussion of the role of higher-order functions in quantum information theory, we define the quantum lambda calculus and its operational semantics. Safety invariants, such as the no-cloning property, are enforced by a static type system that is based on intuitionistic linear logic. We also describe a type inference algorithm and a categorical semantics.
4.1 Introduction
The lambda calculus, developed in the 1930s by Church and Curry, is a formalism for expressing higher-order functions. In a nutshell, a higher-order function is a function that inputs or outputs a “black box,” which is itself a (possibly higher-order) function. Higher-order functions are a computationally powerful tool. Indeed, the pure untyped lambda calculus has the same computational power as Turing machines (Turing 1937). At the same time, higher-order functions are a useful abstraction for programmers. They form the basis of functional programming languages such as LISP (McCarthy 1960), Scheme (Sussman and Steele 1975), ML (Milner 1978), and Haskell (Hudak et al. 2007).
In this chapter, we discuss how to combine higher-order functions with quantum computation. We believe that this is an interesting question for a number of reasons. First, the combination of higher-order functions with quantum phenomena raises the prospect of entangled functions. Certain well-known quantum phenomena can be naturally described in terms of entangled functions, and we give some examples of this in Section 4.2.
- Type
- Chapter
- Information
- Semantic Techniques in Quantum Computation , pp. 135 - 172Publisher: Cambridge University PressPrint publication year: 2009
References
(1993) Computational interpretations of linear logic. Theoretical Computer Science 111:3–57.CrossRefGoogle Scholar
, and (2005) A functional quantum programming language. In Proceedings of the 20th IEEE Symposium on Logic in Computer Science, LICS'05, pages 249–258. IEEE Computer Society Press.Google Scholar
(1984) The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundation of Mathematics. North Holland, second edition.Google Scholar
, , , , , and (1993) Tele-porting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters 70(13):1895–1899.CrossRefGoogle ScholarPubMed
, and (1992) Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physical Review Letters 69(20):2881–2884.CrossRefGoogle ScholarPubMed
(1995) A mixed linear and non-linear logic: Proofs, terms and models (extended abstract). In Proceedings of the Eighth Workshop on Computer Science Logic, CSL'94, Selected Papers, volume 933 of Lecture Notes in Computer Science, pages 121–135. Springer.Google Scholar
, , , and (1993a) Linear A-calculus and categorical models revisited. In Proceedings of the Sixth Workshop on Computer Science Logic, CSL'92, Selected Papers, volume 702 of Lecture Notes in Computer Science, pages 61–84. Springer.Google Scholar
, , , and (1993b) A term calculus for intuitionistic linear logic. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, TLCA '93, volume 664 of Lecture Notes in Computer Science, pages 75–90. Springer.Google Scholar
, and (1996) Linear logic, monads and the lambda calculus. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science, LICS'96, pages 420–431. IEEE Computer Society Press.Google Scholar
(1993) On Intuitionistic Linear Logic. Ph.D. thesis, University of Cambridge Computer Laboratory, Cambridge, England. Available as Technical Report 346, August 1994.Google Scholar
, and (1992) Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London A 439:553–558.CrossRefGoogle Scholar
, , , and (2007) A history of Haskell: Being lazy with class. In HOPL III: Proceedings of the Third ACM SIGPLAN Conference on History of Programming Languages, pages 12.1-55. Association for Computing Machinery.Google Scholar
(1996) Conventions for quantum pseudocode. Technical Report LAUR-96-2724, Los Alamos National Laboratory.CrossRefGoogle Scholar
, and (1986) Introduction to Higher Order Categorical Logic, volume 7 of Cambridge Studies in Advanced Mathematics. Cambridge University Press.Google Scholar
(1971) Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer.CrossRefGoogle Scholar
(2004) Models of Linear Polymorphism. Ph.D. thesis, School of Computer Science, University of Birmingham.Google Scholar
(1960) Recursive functions of symbolic expressions and their computation by machine, part I. Communications of the ACM 3(4):184–195.CrossRefGoogle Scholar
(2003) Categorical models of linear logic revisited. Technical Report 22, Laboratoire Preuves, Programmes et Systèmes, CNRS and Paris 7.Google Scholar
(1978) A theory of type polymorphism in programming. Journal of Computer and System Sciences 17:348–375.CrossRefGoogle Scholar
(1991) Notions of computation and monads. Information and Computation 93(1):55-92.CrossRefGoogle Scholar
(2004) What is a categorical model of linear logic? Manuscript, available from http://www.cs.man.ac.uk/~schalk/work.html.Google Scholar
(1989) Linear logic, *-autonomous categories and cofree coalgebras. In Proceedings of Categories in Computer Science and Logic, Boulder, 1987, volume 92 of Contemporary Mathematics, pages 371–382. American Mathematical Society.Google Scholar
(2004) Towards a quantum programming language. Mathematical Structures in Computer Science 14(4):527–586.CrossRefGoogle Scholar
, and (2005) A lambda calculus for quantum computation with classical control. In Proceedings of the Seventh International Conference on Typed Lambda Calculi and Applications, TLCA '05, volume 3461 of Lecture Notes in Computer Science, pages 354-368. Springer.Google Scholar
, and (2006) A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16(3):527–552.CrossRefGoogle Scholar
, and (2008a) A linear-non-linear model for a computational call-by-value lambda calculus. In Proceedings of the Eleventh International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2008, volume 4962 of Lecture Notes in Computer Science, pages 81–96. Budapest.Google Scholar
, and (2008b) On a fully abstract model for a quantum linear functional language. In Proceedings of the Fourth International Workshop on Quantum Programming Languages, QPL 2006, volume 210 of Electronic Notes in Theoretical Computer Science, pages 123-137.Google Scholar
, and (1975) Scheme: An interpreter for extended lambda calculus. Technical Report AIM-349, MIT.Google Scholar
(1992) Lectures on Linear Logic, volume 29 of CSLI Lecture Notes. University of Chicago Press, second edition.Google Scholar
(1937) On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2 42:230–265.Google Scholar
(2004a) A functional Programming Language for Quantum Computation with Classical Control. Master's thesis, Department of Mathematics and Statistics, University of Ottawa.Google Scholar
(2004b) Quantum typing. In Proceedings of the Second International Workshop on Quantum Programming Languages, QPL 2004, TUCS General Publication 33, pages 163-178. Turku Centre for Computer Science, Turku, Finland.Google Scholar
(2008) Semantics for a Higher-Order Functional Programming Language for Quantum Computation. Ph.D. thesis, Department of Mathematics and Statistics, University of Ottawa.Google Scholar
(2004) A lambda calculus for quantum computation. SIAM Journal of Computing 33(5):1109–1135.CrossRefGoogle Scholar
- 33
- Cited by