[quotemsg=18661584,0,328798][quotemsg=18661430,0,723938]What Google claim? Search "Shor's algorithm", or "Post-quantum cryptography". Basically, some calculations are extremely faster. Some, including prime numbers, not so much.
IMO, if it's number theory related, don't expect "exponentially faster" solutions. I wish they existed, but, it's so basic, it doesn't yield.[/quotemsg]Google's claim that the previous generation was 10,000x faster than a modern, single CPU core.
And your point about speed-up is that it's only exponential for certain classes of cost functions, correct?[/quotemsg]
I don't know what a cost function is, but basically, there are different ways to encrypt things. Some ways are vulnerable to quantum computers, but others (modern), aren't.
For modern encryption, we are talking about squared reduction. But encryption is about "disappearing", if you will.
Many other types of calculations are reduced by orders of magnitude. Like going from exponential to polynomial time. So it's not that clear. Their figures are total guesses, IMO.
Quantum computing is awesome, powerful, and has potential. But it's not "THE HAMMER OF GOD". Some things will remain hard to do. And modern encryption is hard.