Well, for certain classes of problems, it is certainly proven that quantum algorithms are faster than classical algorithms. And they're not totally theoretical pie-in-the-sky; you can implement a 5- or 16-qubit version of Shor's algorithm in IBM Q Experience[0] and run it on a real, physical quantum computer. The growing pains are in implementing quantum computers that are large enough to be of practical importance, and then building those systems several-fold larger for Quantum Fault Tolerance.[1]
Quantum computers are never going to replace or speed up every aspect of classical computation, but the idea of accessing them as a service for certain types of computation is probably not many decades off.
[0] https://quantumexperience.ng.bluemix.net/proxy/tutorial/full...
[1] https://en.wikipedia.org/wiki/Quantum_error_correction