3 ms·
The problem with your hypothesis is that quantum mechanics make the calculation more difficult/costly, not more efficient. The easiest way to show this propert
by gus_massa 9y ago
The problem with your hypothesis is that quantum mechanics make the calculation more difficult/costly, not more efficient.
The easiest way to show this property are quantum computers. If you have a quantum computer with n qbits, you have 2^n combinations, so to simulate a quantum computer in a classical computer you need O(2^n) time. So it's very inefficient.
[On the other hand, for a small set of lucky problems, if you construct a quantum computer you can solve in polynomial time some problems that require exponential time in classical computers. (But remember that not every problem get this speedup, and it's very difficult to construct a general quantum computer with more than a few qbits.)]