Quantum Computing Era: Hardware, Cryptographic Threat & Commercialization
Tracks the arrival of the quantum computing era across three axes: (1) hardware progress — superconducting, neutral-atom, trapped-ion, photonic systems crossing logical-qubit thresholds; (2) cryptographic threat timeline — Shor's algorithm resource estimates collapsing, PQC migration status, store-now-decrypt-later window; (3) commercialization — Xanadu/IonQ/Infleqtion IPO wave, sovereign investment (US $6.6B private in 2025, China $17.6B total, EU $11.8B), Bain market forecasts. Distinct from ai-economic-transformation — this is about quantum substrate and its systemic implications.
Two weeks compressed the quantum clock. Nobody is ready for what comes after.
The qubit count needed to break internet cryptography fell by 40x, then by 20x, in the same fortnight — and that is the boring part of the story.
Peter Shor's 1994 paper stamped an expiry date on public-key cryptography. RSA, ECC, Diffie-Hellman all rest on problems that a large enough quantum computer cracks in polynomial time. For three decades the answer was the same shrug: the machine does not exist yet, and building it looks very hard. That shrug just got harder to hold on to. The gap between "theory" and "engineering" has finally started to close.
On 31 March Google Quantum AI revised down the qubit cost of breaking ECDLP-256 by 20x — under 1,200 logical qubits, about 500,000 physical. Same day, ex-Google/Caltech researchers at Oratomic argued Shor's algorithm fits on as few as 10,000 reconfigurable atomic qubits. Another 40x. When two independent teams move the same threshold in the same week, that is not one more estimate but a reassessment — and Google said so out loud, framing its own paper as a call to accelerate post-quantum migration.
The reassessment only holds together because of Google's Willow chip in late 2024. For the first time, surface-code scaling worked the way theory promised: more physical qubits per logical qubit halved the logical error rate instead of raising it. Before Willow, error correction got worse with scale. After Willow, building a fault-tolerant machine became an engineering problem, not a physics question.
The idea that actually makes this alarming is "harvest-now-decrypt-later." Encrypted traffic adversaries log today becomes readable the moment large quantum computers exist, and a 2025 Telecom paper formalized HNDL as a temporal risk: every month of PQC migration delay grows the bill, it does not hold it. NIST's August 2024 FIPS 203/204/205 standards named the destination. Google just told the market it intends to arrive by 2029 — six years ahead of the federal 2035 target. Cloud customers inherit that schedule whether they planned to or not.
The commercial side is on a different clock. Xanadu SPAC-listed on Nasdaq on 31 March and opened +15%, after Horizon and IonQ — but Horizon is down 18% since debut and Infleqtion off 30%+ since its February NYSE listing. Capital wants to own whichever substrate will matter in 2030, and public markets cannot yet price a decade of waiting. Bain expects commercially meaningful demos (100 logical qubits) by 2028-2029, real applications (1,000-10,000 logical qubits) in the mid-2030s. And here is the uncomfortable bit: the cryptographic threat is arriving faster than the commercial payoff.
Signals
Timeline
ASSESSMENT — STATE OF THE QUANTUM ERA, MAY 2026. Three axes, three tempos. (1) HARDWARE — slow but architecturally validated. Willow (Dec 2024) demonstrated below-threshold surface-code scaling — the…
Cornell researchers reported (via Phys.org, April 22) that α-RuCl₃ (alpha ruthenium chloride), a crystal long studied as a candidate Kitaev quantum-spin-liquid host where Majorana-like anyons might…
John Martinis — 2025 physics Nobel laureate and the lead of Google's 2019 Sycamore "quantum supremacy" experiment — publicly endorses the policy implication of Google Quantum AI's 31 March paper. He…
Xanadu Quantum begins trading on Nasdaq and the Toronto Stock Exchange via a SPAC merger with Crane Harbor Acquisition; shares opened +15% in the US. Xanadu follows Horizon Quantum and IonQ as the…
Oratomic (ex-Google/Caltech researchers) publishes an arxiv paper arguing Shor's algorithm can break cryptographically relevant encryption with as few as 10,000 reconfigurable atomic qubits — roughly…
Google Quantum AI publishes a whitepaper revising the quantum resource cost of breaking elliptic-curve cryptography. The team now estimates ECDLP-256 can be broken with fewer than 1,200 logical…
Google has set an internal 2029 deadline to complete its post-quantum cryptography migration — six years ahead of the US federal government's stated target. The shift is explicitly driven by the…
Formal modeling paper in Telecom (MDPI, doi 10.3390/telecom6040100) treats harvest-now-decrypt-later (HNDL) as a temporal risk: today's encrypted communications become retroactively vulnerable once…
Google announces the Willow chip (Nature, Dec 2024) demonstrating that scaling a surface code from distance 3 to distance 5 to distance 7 halves the logical error rate at each step — the long-sought…
NIST publishes its first three finalized post-quantum cryptography standards after an eight-year competition (launched 2016): FIPS 203 (ML-KEM, based on CRYSTALS-Kyber) for key establishment, FIPS…
Team led by Pan Jianwei and Lu Chao-Yang at the University of Science and Technology of China (USTC) reports the Jiuzhang photonic quantum computer in Science: 76-photon Gaussian boson sampling in…
Google's 53-qubit superconducting Sycamore processor samples from a random quantum circuit in 200 seconds; Google estimates the same task would take ~10,000 years on Summit, the leading classical…
Peter Shor presents his polynomial-time quantum algorithms for integer factorization and discrete logarithm at FOCS 1994 (expanded 1997, SIAM J. Computing). The classical cryptographic alarm starts…
Richard Feynman's paper in International Journal of Theoretical Physics (vol. 21, 1982) argues that simulating quantum-mechanical systems on classical computers requires exponential resources, and…