Physics – Quantum Physics
Scientific paper
2007-10-17
Physics
Quantum Physics
17 pages, expands on arXiv:0705.3077v1 [quant-ph]
Scientific paper
Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. The problem of universality has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani as well as Kitaev and Solovay. The quantum logic circuit model, developed by Feynman and Deutsch, has been more prominent in the research literature than Deutsch's quantum Turing machines. 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 this key notion in theoretical computer science is scrutinised in quantum computing by distinguishing various connotations and concomitant results and problems.
Fouche' Willem
Heidema Johannes
Jones Glyn
Potgieter Petrus H.
No associations
LandOfFree
Universality and programmability of quantum computers 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 Universality and programmability of quantum computers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universality and programmability of quantum computers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-12081