A lambda calculus for quantum computation with classical control
| dc.creator | Selinger, Peter | |
| dc.creator | Valiron, Benoit | |
| dc.date | 2004-04-27 | |
| dc.date | 2004-11-12 | |
| dc.date.accessioned | 2026-07-07T12:46:48Z | |
| dc.date.available | 2026-07-07T12:46:48Z | |
| dc.description | 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. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/cs/0404056 | |
| dc.identifier | http://arxiv.org/abs/cs/0404056 | |
| dc.identifier | Proc. of TLCA 2005 | |
| dc.identifier | doi:10.1007/11417170_26 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/221510 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.4.1 | |
| dc.title | A lambda calculus for quantum computation with classical control | |
| dc.type | text |