Shor's algorithm, running on a quantum computer is a polynomial time factoring algorithm. Polynomial in the number of digits, that is. By the time that we can build a quantum computer that can factor an interesting number, we are maybe half a year to two years away from breaking cryptography. In other words, by the time you see an actual useful computation out of a quantum computer, the house is already halfway burned down.