Deutsch's Universal Quantum Turing Machine (Revisited)
| dc.creator | Fouché, Willem | |
| dc.creator | Heidema, Johannes | |
| dc.creator | Jones, Glyn | |
| dc.creator | Potgieter, Petrus H. | |
| dc.date | 2007-01-16 | |
| dc.date.accessioned | 2026-07-07T07:41:21Z | |
| dc.date.available | 2026-07-07T07:41:21Z | |
| dc.description | Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. This interesting problem has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani. Quantum Turing machines form a class closely related to deterministic and probabilistic Turing machines and one might hope to find a universal machine in this class. A universal machine is the basis of a notion of programmability. The extent to which universality has in fact been established by the pioneers in the field is examined and a key notion in theoretical computer science (universality) is scrutinised. In a forthcoming paper, the authors will also consider universality in the quantum gate model. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0701108 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0701108 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/122075 | |
| dc.subject | Quantum Physics | |
| dc.title | Deutsch's Universal Quantum Turing Machine (Revisited) | |
| dc.type | text |