As a reminder, current estimates are that quantum cracking of a single 2048-bit RSA key would require a computer with 20 million qubits running in superposition for about eight hours. For context, quantum computers maxed out at 433 qubits in 2022 and 1,000 qubits last year. (A qubit is a basic unit of quantum computing, analogous to the binary bit in classical computing. Comparisons between qubits in true quantum systems and quantum annealers aren’t uniform.) So even when quantum computing matures sufficiently to break vulnerable algorithms, it could take decades or longer before the majority of keys are cracked.

The upshot of this latest episode is that while quantum computing will almost undoubtedly topple many of the most widely used forms of encryption used today, that calamitous event won’t happen anytime soon. It’s important that industries and researchers move swiftly to devise quantum-resistant algorithms and implement them widely. At the same time, people should take steps not to get steamrolled by the PQC hype train.

  • humblebun@sh.itjust.works
    link
    fedilink
    English
    arrow-up
    10
    ·
    18 days ago

    Ok, I decided to dive into it today again and look what I’ve found:

    1. They still demonstrate supremacy to each other proving that their setup couldn’t be simulated. These 433 and 1000 qubit processors are good only for one purpose: to simulate itself.

    2. Photonic QC still estimates hafnian billions times faster; if only this mathematical structure appeared to have any practical meaning

    3. They demonstrated that toric codes might be effective