Google claims to have proved its supremacy over conventional machines with new quantum computer

Is it akin to the revolutionary code-breaking system from Digital Fortress called TRANSLTR?

I hope it won’t.

  •  Pseu   ( @Pseu@beehaw.org ) 
    17•1 year ago

    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.

    •  argv_minus_one   ( @argv_minus_one@beehaw.org ) 
      8•1 year ago

      “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.