Computer science Randomized, circuit, counting and interactive complexity Concept
Quantum Turing machine
Summary
A quantum Turing machine is a model of quantum computation built like a Turing machine, whose configurations can be in superposition. Its steps act on these superpositions by a unitary operator, and a measurement at the end gives a random output. David Deutsch proposed it in 1985, and Bernstein and Vazirani developed its complexity theory. It defines the class BQP, and it is equivalent in power to uniform families of quantum circuits.
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | E1P61VYRRD |
|---|---|
| URI | m2://E1P61VYRRD |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q12, 68Q09, 81P68 |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.