A Lambda Calculus for Quantum Computation release_jxmltfc4hzhrjjto3qlunp7mne

by Andre van Tonder

Released as a report .

2004  

Abstract

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 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.
In text/plain format

Archived Files and Locations

application/pdf  296.8 kB
file_6kwoyhrgdbdibcd4zh7onxej4y
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  report
Stage   accepted
Date   2004-04-03
Version   v5
Language   en ?
Number  BROWN-HET-1366
arXiv  quant-ph/0307150v5
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 562dabc2-6bb9-46c3-9026-28fcf47c75d9
API URL: JSON