A lambda calculus for quantum computation with classical control
Abstract
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the first author's work on quantum flow-charts. We define a call-by-value operational semantics, and we give a type system using affine intuitionistic linear logic. The main results of this paper are the safety properties of the language and the development of a type inference algorithm.
Cite
@article{arxiv.cs/0404056,
title = {A lambda calculus for quantum computation with classical control},
author = {Peter Selinger and Benoit Valiron},
journal= {arXiv preprint arXiv:cs/0404056},
year = {2009}
}
Comments
15 pages, submitted to TLCA'05. Note: this is basically the work done during the first author master, his thesis can be found on his webpage. Modifications: almost everything reformulated; recursion removed since the way it was stated didn't satisfy lemma 11; type inference algorithm added; example of an implementation of quantum teleportation added