Loading story…
A multi-institutional roadmap has outlined how neutral-atom quantum computing could reach practical quantum advantage within a decade if current scaling trends continue, arguing that recent gains in qubit counts and gate fidelity are beginning to converge with falling theoretical resource estimates for fault-tolerant workloads. The roadmap maps application regimes by computational scale and places cryptanalysis tasks such as RSA-2048 factoring and ECC-256 discrete logarithms in the highest resource band, while highlighting qLDPC error-correction codes as a potential advantage for neutral-atom systems because their reconfigurable connectivity may reduce physical-qubit overhead compared with surface-code approaches. A related Nature paper also reports a fault-tolerant neutral-atom architecture for universal quantum computation, reinforcing the platform’s technical momentum.
At the same time, the reporting stresses that cryptanalytically relevant quantum capability is not imminent. Major engineering gaps remain in integrating scale, fidelity, decoding, readout, and sustained fault-tolerant operation into a single system, and some roadmap claims still rely on preprints rather than fully matured results. Separate industry analysis argues that while quantum computing often appears to be a "perpetual five-year technology," concrete thresholds such as machines capable of breaking RSA-2048 are already definable enough for enterprise planning, and that organizations should not use uncertainty over timelines or winning architectures as a reason to delay post-quantum cryptography migration.
Mallory correlates global threat intelligence with your attack surface — know if you’re exposed before adversaries strike.
7 events from the most recent confirmed update back to the earliest known activity.
New Scientist published a column with the headline “Why full-fledged quantum computers might always be five years away.” The article says this presented Jurczak’s PFYT thesis largely unchallenged and framed it as indefinite non-arrival.
A multi-institutional team posted a 135-page strategic plan for neutral-atom quantum computation on arXiv. The roadmap argued that practical quantum advantage could be reached within a decade if recent scaling trends continue.
Christophe Jurczak published a paper in MDPI’s Philosophies journal arguing that quantum computing is a “Perpetual Five-Year Technology.” The paper framed the recurring five-year horizon as a structural feature of the field rather than a simple forecasting failure.
The Lukin group reported 99.85% raw CZ fidelity and 99.94% fidelity with loss postselection in a neutral-atom system. The article presents this as a notable experimental milestone in gate performance.
Bluvstein et al. demonstrated below-threshold error correction on a neutral-atom processor using atom-loss detection and machine-learning decoding. The roadmap cites this result as a key credibility anchor for near-term neutral-atom fault tolerance.
Christophe Jurczak’s later PFYT paper is described as building on a Quantonation whitepaper that introduced the “Perpetual Five-Year Technology” concept. This marks the earlier publication of the framework later discussed in 2026.
A strategic roadmap for neutral-atom quantum computation grew out of an NSF-funded town hall held at MIT’s Endicott House. The meeting is identified as an early organizing event behind the later roadmap.
3 references tracked. Mallory keeps watching after this page renders.
postquantum.com
Open sourcepostquantum.com
Open sourcenature.com
Open sourceMap indicators from this story to your assets and identify affected systems in minutes.
Every observed campaign, victim, and pivot linked to actors named in this story.
Malware, exploits, and IOCs connected to the activity described here.
YARA, Sigma, and Snort rules deployed to your SIEM as soon as they’re published.
Get matching new stories delivered to your team as they break — not the next morning.
Ask questions about this story and take action on the answers.
Other stories Mallory is tracking that overlap on entities, sources, or topic labels.
New quantum-computing research has significantly reduced the estimated resources needed to break widely used public-key cryptography, increasing pressure on organizations still relying on **RSA-2048** and **256-bit elliptic-curve cryptography**. A 2025 Google Quantum AI preprint reported that RSA-2048 factoring could, in theory, be achieved in less than a week with fewer than **1 million noisy qubits**, down roughly **20×** from earlier estimates, by combining techniques such as approximate residue arithmetic, yoked surface-code storage, and magic state cultivation. Separate reporting also described architectural work that could cut the hardware needed for RSA-2048 attacks by about **tenfold**, reinforcing the trend that algorithmic and engineering advances are shrinking the gap between theory and practical cryptanalytic capability. A 2026 paper on the elliptic-curve discrete logarithm problem similarly reduced the logical-qubit footprint for Shor-based attacks, estimating that a **256-bit prime-field curve** could be targeted with about **1,333 logical qubits**, down from **2,124** in a prior low-width design. Commentary on the new results highlighted an additional Caltech advance in lower-overhead fault tolerance and argued that, taken together, these developments could bring quantum attacks against systems such as **Bitcoin signatures** closer than previously expected, with some estimates dropping from millions of physical qubits to around **25,000** under favorable assumptions. While the work remains theoretical and depends on future fault-tolerant hardware, the direction of travel is clear: advances in quantum algorithms and error correction are accelerating the case for migration to **post-quantum cryptography**.
Jun 29, 2026
Quantum computing has rapidly transitioned from research labs to mainstream technology, with 2025 marking a significant surge in enterprise adoption and national investment. Post-quantum cryptography remains a primary focus due to its security implications, but a growing array of business use cases is emerging as organizations and governments recognize the transformative potential of quantum technologies. Major technology companies such as Google and IBM are providing accessible quantum development tools, frameworks, and cloud-based platforms, while open-source projects and development kits like TKET, Qiskit, and QuTiP are accelerating innovation and collaboration across the ecosystem. National governments are investing millions to secure leadership in quantum computing, fostering partnerships among hardware manufacturers, software developers, startups, academia, and public sector entities. The proliferation of open-source quantum projects on platforms like GitHub and QOSF, along with the rapid advancement of compilers and algorithms, is fueling the growth of quantum-proficient talent and expanding the practical deployment of quantum systems. This collective momentum signals the arrival of the "quantum decade," with significant implications for encryption, key management, and the future of secure digital infrastructure.
Jun 29, 2026
U.S. federal experts told a House Science, Space and Technology Committee hearing that **quantum technology commercialization** will require tighter coordination between government labs and industry, with agencies like **NIST** positioned to co-develop capabilities that private companies can productize. Testimony emphasized that while the application landscape remains early, progress is moving beyond the “noisy intermediate-scale quantum” era, citing **demonstrations of quantum error correction** as a sign of maturation and noting expectations that **fault-tolerant quantum computing** could emerge around 2030. Separately, quantum-software firm **BlueQubit** announced a public “Quantum Advantage Challenge” offering a **0.25 BTC (~$22.5K) prize** to anyone who can recover a private key/hidden bitstring embedded in a **quantum-optimized** search problem. BlueQubit claims its approach can identify a hidden bitstring in a `2^56` search space in under two hours, while asserting classical supercomputers would take years; the challenge is framed as a verifiable demonstration of **quantum advantage** applied to a cryptography-adjacent task, amid broader industry skepticism about prior “quantum advantage/supremacy” claims.
Jun 29, 2026