Is it possible to define a function in terms of quantum computers that grows faster then any that is defined in terms of turing machines?
Asked
Active
Viewed 55 times
1 Answers
2
No, a quantum computer can be simulated by a classical one, and hence anything that can be computed by a quantum computer can also be computed by a Turing machine.
The classical computer might take much longer than the quantum one, but the final result of the computation would be the same.
Oscar Cunningham
- 16,299