Google said its quantum computer needed less than five minutes to perform a mathematical calculation that one of the world’s most powerful supercomputers could not complete in 10 septillion years, a length of time that exceeds the age of the known universe.
Comments
Oh.
The verbiage used reminds me of the Ackermann function being used to shit talk programming languages without recursion.
So... they haven't done anything with it?
…does anybody need a bridge that can do that?
No. Certainly not. But it’s one of the greatest achievements of mankind.
This type of computing will not be *readily* available in the near future(so while some governments will have access, your average criminal organization won’t).
At the same time there will also be post-quantum encryption which will come into play as it becomes readily avail
Gotta kill crypto for as long as possible though.
Oh. Really.
"14 hours, a length of time that exceeds the time it takes eyelids to blink."
What the actual....
Put Elon musk in charge it will instantly go downhill
I joke i joke. It's not like that would ever happen. 😬
I'd solve it in an hour tops
it's like calling a cup of coffee a supercomputer because it can very accurately compute the temperature of a cup of coffeem
The calculation was probably something to the effect of finding a prime number past the last known prime number. Once it finds that number, you can easily figure out whether or not it's a prime number.
I mean, if guessing is on the table, I could easily do that faster! Just saying...
https://en.wikipedia.org/wiki/NP-completeness
Any problem at NP complete complexity or lower can be verified quickly even if solving them is hard
Just kidding. This is verrry impressive work.
https://en.wikipedia.org/wiki/Oracle_machine
IOW, it's easy to compute something seventy gazillion times faster when you allow yourself an, and I quote, error threshold.
Here's an archived copy of this story for digital preservation:
https://archive.ph/60uiB
“See youuuuu 🎵
In Septillionnnnn…”