A Lambda Calculus for Quantum Computation

  title={A Lambda Calculus for Quantum Computation},
  author={Andr{\'e} van Tonder},
  journal={SIAM J. Comput.},
  • A. V. Tonder
  • Published 21 July 2003
  • Computer Science
  • SIAM J. Comput.
The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine and continues to be of enormous benefit in the classical theory of computation. We propose that quantum computation, like its classical counterpart, may benefit from a version of the lambda calculus suitable for expressing and reasoning about quantum algorithms. In this paper we develop a… 
A lambda calculus for quantum computation with classical control
A functional programming language for quantum computers, by extending the simply-typed lambda calculus with quantum types and operations, and gives a type system using affine intuitionistic linear logic.
Linear-algebraic lambda-calculus
A functional language where all functions are linear operators by construction is defined, and the linear-algebraic lambda-calculus hereby constructed is linear in a different (yet related) sense to that, say, of the linear lambda-Calculus.
A Double Effect λ-calculus for Quantum Computation
This paper presents a double effect version of the simply typed λ-calculus where it allows to express quantum algorithms including reversible operations over pure states and measurements in the middle of the computation using a traditional style of functional programming and reasoning.
A Lambda Calculus for Quantum Computation with Classical Control
The main results of this paper are the safety properties of the language and the development of a type inference algorithm.
Toward a quantum process algebra
This paper aims at defining a high level language allowing the description of classical and quantum programming, and their cooperation, and process algebras are chosen as a basis for this language.
Quantum lambda calculus
This chapter discusses how to combine higher-order functions with quantum computation, and investigates the interplay between classical objects and quantum objects in a higherorder context.
Higher-order semantics for quantum programming languages with classical control
This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process that lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers.
A theory of computation based on quantum logic (I)
  • M. Ying
  • Philosophy
    2005 IEEE International Conference on Granular Computing
  • 2005
1 Quantum Lambda Calculus
The quantum lambda calculus is defined and safety invariants, such as the no-cloning property, are enforced by a static type system that is based on intuitionistic linear logic.
An Extension of Gleason's Theorem for Quantum Computation
We develop a synthesis of Turing's paradigm of computation and von Neumann's quantum logic to serve as a model for quantum computation with recursion, such that potentially non-terminating


Quantum complexity theory
This dissertation proves that relative to an oracle chosen uniformly at random, the class NP cannot be solved on a quantum Turing machine in time $o(2\sp{n/2}).$ and gives evidence suggesting that quantum Turing Machines cannot efficiently solve all of NP.
Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms
A formal metalanguage called the lambda-p calculus is introduced for the specification of programming languages that allow true random number generation and it is demonstrated how selected randomized algorithms can be programmed directly in the Lambda-q calculus.
The lambda-q calculus can efficiently simulate quantum computers
The lambda-q calculus may be strictly stronger than quantum computers because NP-complete problems such as satisfiability are efficiently solvable in the lambda-Q calculus but there is a widespread doubt that they are efficientlysolvable by quantum computers.
Quantum Computation, Categorical Semantics and Linear Logic
A type theory and denotational semantics are developed and provided for a simple fragment of the quantum lambda calculus, a formal language for quantum computation based on linear logic.
Quantum theory, the Church–Turing principle and the universal quantum computer
  • D. Deutsch
  • Physics, Philosophy
    Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1985
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizible
Towards a quantum programming language
  • P. Selinger
  • Computer Science
    Mathematical Structures in Computer Science
  • 2004
This paper describes the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types, and has an interesting denotational semantics in terms of complete partial orders of superoperators.
Toward an architecture for quantum programming
A template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives, and easily lends itself to automatic, hardware independent, circuit simplification.
Quantum Circuit Complexity
  • A. Yao
  • Computer Science
  • 1993
It is shown that any function computable in polynomial time by a quantum Turing machine has aPolynomial-size quantum circuit, and this result enables us to construct a universal quantum computer which can simulate a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them.
A Procedural Formalism for Quantum Computing
QCL (Quantum Computation Language) is a hight level, architecture independent programming language for quantum computers, with a syntax derived from classical procedural languages like C or Pascal, which allows for the complete implementation and simulation of quantum algorithms in one consistent formalism.
Computational Interpretations of Linear Logic