A Physics-Free Introduction to the Quantum Computation Model

Simple item page
dc.creatorFenner, Stephen A.
dc.date2003-04-04
dc.date.accessioned2026-07-07T06:34:55Z
dc.date.available2026-07-07T06:34:55Z
dc.descriptionThis article defines and proves basic properties of the standard quantum circuit model of computation. The model is developed abstractly in close analogy with (classical) deterministic and probabilistic circuits, without recourse to any physical concepts or principles. It is intended as a primer for theoretical computer scientists who do not know--and perhaps do not care to know--any physics.
dc.description18 pages, 18 figures. Expanded write-up for BEATCS of introductory talk given at Dagstuhl Seminar 02421, "Algebraic Methods in Quantum and Classical Models of Computation," October 2002
dc.identifierhttps://arxiv.org/abs/cs/0304008
dc.identifierhttp://arxiv.org/abs/cs/0304008
dc.identifierBulletin of the European Association for Theoretical Computer Science, 79(Feb 2003), 69-85
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/99669
dc.subjectComputational Complexity
dc.subjectQuantum Physics
dc.subjectF.1.1; F.1.2; F.1.3
dc.titleA Physics-Free Introduction to the Quantum Computation Model
dc.typetext

Files

Collections

arXiv