A Lambda Calculus for Quantum Computation

Simple item page
dc.creatorvan Tonder, Andre
dc.date2003-07-21
dc.date2004-04-03
dc.date.accessioned2026-07-07T06:07:24Z
dc.date.available2026-07-07T06:07:24Z
dc.descriptionThe 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 quantum lambda calculus as an alternative model of quantum computation, which combines some of the benefits of both the quantum Turing machine and the quantum circuit models. The calculus turns out to be closely related to the linear lambda calculi used in the study of Linear Logic. We set up a computational model and an equational proof system for this calculus, and we argue that it is equivalent to the quantum Turing machine.
dc.descriptionTo appear in SIAM Journal on Computing. Minor corrections and improvements. Simulator available at http://www.het.brown.edu/people/andre/qlambda/index.html
dc.identifierhttps://arxiv.org/abs/quant-ph/0307150
dc.identifierhttp://arxiv.org/abs/quant-ph/0307150
dc.identifierSIAM J.Comput. 33 (2004) 1109-1135
dc.identifierdoi:10.1137/S0097539703432165
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91279
dc.subjectQuantum Physics
dc.subjectLogic in Computer Science
dc.subjectHigh Energy Physics - Theory
dc.titleA Lambda Calculus for Quantum Computation
dc.typetext

Files

Collections

arXiv