For a very select set of problems (factoring and discrete log), quantum computers are exponentially faster than classical computers. For a few (including np-complete problems), they are quadratically faster. For everything else, they're no faster. (When I say "faster", I really mean the runtime of the best known quantum algorithms is better.)
For the forseeable future, quantum computers will be much smaller than classical computers -- the article is about Google building a 49 bit QC and how that would be a breakthrough. So for the forseeable future, they'll be separate components, used for special cases.
A generalized quantum computer able to run standard computing algorithms is very far in the future and so much basic research in computing science has to happen before it can be talked about meaningfully.
That's quite an uninformed comment. Anybody thinking this can start at Wikipedia:
https://en.wikipedia.org/wiki/Quantum_computing#Timeline
That list has completely functional computers with up to 4 qbits with results to show.
If you are willing to accept comparisons of best known classical algorithms to best known quantum algorithms (without a guarantee that the existing algorithms are ideal) you can add others like factoring to the list, with exponential speed ups.