Curator's Take
This article spotlights two new studies that tighten the resource estimates for running Shor’s algorithm, showing that fewer logical qubits and shallower circuits may suffice to break RSA‑2048 and elliptic‑curve keys than previously thought. By aligning with recent advances in error‑corrected hardware roadmaps from IBM and Google, the findings push the timeline for a cryptographically relevant quantum computer closer to the near term. The implication is clear: organizations should accelerate their transition to post‑quantum cryptography, even as practical, fault‑tolerant machines are still under development.
— Mark Eatherly
Summary
Two recent papers suggest that quantum computers may crack modern cryptography sooner than expected The post New findings shorten the road to cryptographically relevant quantum computers appeared first on Physics World .