Deutsch's Universal Quantum Turing Machine (Revisited)

Details Deutsch's Universal Quantum Turing Machine (Revisited) Deutsch's Universal Quantum Turing Machine (Revisited)

2007-01-16

arxiv.org/abs/quant-ph/0701108v1

Physics

Quantum Physics

7 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Deutsch's Universal Quantum Turing Machine (Revisited) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deutsch's Universal Quantum Turing Machine (Revisited), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deutsch's Universal Quantum Turing Machine (Revisited) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-189253