Re:How Quantum Computers Will Correct Their Errors
by krastanov on Friday November 19, 2021 @01:35PM
(#29280635)
Just a minor extension to this answer: efficiently simulating quantum mechanics is of practical interest, given that much of chemistry, physics, and material science depends on working with numerical models of nature.
Basically, with all known algorithms, a classical computer needs exponential time to simulate a quantum computer.
This is not yet a proven fact (P != BQP), and given the history of P!=NP, is not likely to be proven too soon.
There are also a few algorithms of more general interest, such as faster than O(n) search, surprisingly (Grover's algorithm, which has a high probability of finding the input that produces a given output of a given function after O(sqrt n) steps).