4 ms·

Probably just research on quantum computers? I don't think it's big enough to let you solve any practical problems, but maybe someone can correct me

• d3m0t3p 2y ago
  IF (and that's a big if) that's true then it means they can factorize number into primes with this quantum computer and break encryption.
  • Ar-Curunir 2y ago
    No, this quantum computer cannot factorize the large composite numbers that we use for modern RSA. Even for the numbers that it can factor, I don't think it will be faster than a decent classical computer.
  • wasabi991011 2y ago
    No, that's not what that means. Not sure what you mean by the "that" when you say "if that's true", but there is nothing in this thread or by google that is anywhere close to breaking encryption.
    • bluSCALE4 2y ago
      How are you so sure? If something that takes years is completed in minutes, how is encryption safe?
      • shawabawa3 2y ago
        The amount of cubits required for a practical application of shors algorithm to break modern encryption is known and it's around 2500 qubits Willow has 100
      • wasabi991011 2y ago
        Because the "something" in question is not decryption. It's actually specifically something with no useful result, just a benchmark. Decryption with quantum computers is still likely decades away, as others have pointed out. To be specific, the best know quantum factoring did 15 = 3x5, and when 35 was not able to be factored when attempted. Most experimental demonstrations have stopped in recent years due to how pointless it currently is.