How Quantum Computers Will Correct Their Errors
quantamagazine.org
quantamagazine.org
What will it get us in the short and long term?
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).