Jump to content

Quantum Turing machine

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 122.173.195.139 (talk) at 09:28, 24 February 2010. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A quantum Turing machine (QTM), also a universal quantum computer, is an abstract machine used to model the effect of a quantum computer. It provides a very simple model which captures all of the power of quantum computation. Any quantum algorithm can be expressed formally as a particular quantum Turing machine; thus, quantum Turing machines have the same relation to quantum computation that normal Turing machines have to classical computation. Such computers were first proposed in a 1985 paper written by Oxford University physicist David Deutsch suggesting quantum gates could function in a similar fashion as traditional digital computing binary logic gates.<ref name="Deutsch1985">