| |
| | Quantum Computability |
 | | On the other hand, if quantum Turing machines are allowed unrestricted amplitudes (i.e., arbitrary complex amplitudes), then the corresponding BQP class has uncountable cardinality and contains sets of all Turing degrees. |
 | | Moreover, with unrestricted amplitudes, BQP is not equal to EQP. |
 | | It is shown that when quantum Turing machines are restricted to have transition amplitudes which are algebraic numbers, BQP, EQP, and nondeterministic quantum polynomial time (NQP) are all contained in PP, hence in ${\rm P}^{\#{\rm P}}$ and PSPACE. |
| epubs.siam.org /sam-bin/dbq/article/29363 (264 words) |
|