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?
2026-03-26 14:32:29.1774535549
Function that grows faster then BB(n) using quantum computation?
56 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
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.