Measurement-Based Quantum Turing Machines and their Universality

Simple item page
dc.creatorPerdrix, Simon
dc.creatorJorrand, Philippe
dc.date2004-04-26
dc.date2004-04-27
dc.date.accessioned2026-07-07T06:09:37Z
dc.date.available2026-07-07T06:09:37Z
dc.descriptionQuantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In order to formalize these other forms of computation, while pointing out the role and the necessity of classical control in measurement-based computation, and for establishing a new upper bound of the minimal resources needed to quantum universality, a formal model is introduced by means of Measurement-based Quantum Turing Machines.
dc.description13 pages, based upon quant-ph/0402156 with significant improvements
dc.identifierhttps://arxiv.org/abs/quant-ph/0404146
dc.identifierhttp://arxiv.org/abs/quant-ph/0404146
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92019
dc.subjectQuantum Physics
dc.titleMeasurement-Based Quantum Turing Machines and their Universality
dc.typetext

Files

Collections

arXiv