Is it akin to the revolutionary code-breaking system from Digital Fortress called TRANSLTR?
I hope it won’t.
A nice place to discuss rumors, happenings, innovations, and challenges in the technology sphere. We also welcome discussions on the intersections of technology and society. If it’s technological news or discussion of technology, it probably belongs here.
Remember the overriding ethos on Beehaw: Be(e) Nice. Each user you encounter here is a person, and should be treated with kindness (even if they’re wrong, or use a Linux distro you don’t like). Personal attacks will not be tolerated.
Subcommunities on Beehaw:
This community’s icon was made by Aaron Schneider, under the CC-BY-NC-SA 4.0 license.
It’s a 70-qubit quantum computer. It doesn’t have enough memory to break even rudimentary 128-bit encryption.
The algorithm that it executed was also not Shor’s algorithm (the one that could potentially break encryption). The benchmark used is called random circuit sampling, which is just doing a bunch of random quantum operations between pairs of qubits and then reading the output. It’s one of the fastest quantum speedups of any known algorithm.
“128-bit” usually refers to symmetric encryption, which is not broken by Shor’s algorithm. 4096-bit RSA is what Shor’s algorithm needs to break, and it’s going to take a lot more than 70 qubits to do that. Like, two orders of magnitude more.