From a computer science standpoint this incorrect. Regarding computability, quantum computers have exactly the same power as traditional computers.
What we do know is that there is a known algorithm to factor number in polynomial time on quantum computers and there is not a known algorithm to do so on classical computers. Assuming that factoring numbers is actually a hard problem on classical computers (unproven, but generally accepted), then quantum computers are more powerful than classical ones.
I understood this as, it's impossible to run some algorithms on a traditional computer. You can run Shor's algorithm on a Turing machine, albeit requiring a simulation of qbits. You can run it in javascript and in your browser if you like.
Since Moore's Law is giving us one more bit of decryption per unit time every 1.5 years, 4096 * 1.5 years is probably going to precede the heat death of the universe handily. But 6000-or-so years of Moore's Law does tax credulity.