Nobel Laureate John Martinis on Quantum Computing's Five-Year Threat to Encryption

Executive overview

Quantum computing is not a distant theoretical concern — Nobel Prize winner John Martinis gives a five-to-ten year timeline before a machine large enough to break today's encryption exists. The threat is concrete: Bitcoin's oldest wallets are already vulnerable, and the entire internet's cryptographic foundation predates quantum hardware. Martinis argues that hardware — not algorithms or software — is the critical bottleneck, and that whoever solves scalable qubit fabrication will hold a position analogous to Nvidia in classical computing. Major institutions like Google, IBM, and JP Morgan are already deploying quantum-resistant protocols, but vast swathes of unregulated crypto and private systems remain exposed.

The window to retrofit encryption is now open, and it is measured in years, not decades.

Martinis's 1985 discovery that started the field

• Quantum tunneling was known in theory; Martinis proved it operates in macroscopic electrical circuits
• A circuit "about that big" — not just an atom — obeyed quantum mechanics, including tunneling
• That demonstration made qubits physically realizable in engineered hardware, not just in nature
• His work became the foundation others built into the modern qubit and quantum computing field
• The Nobel Prize in 2024 recognized this chain from discovery to practical machine

Why hardware is the bottleneck, not software

• Hundreds of physical qubits exist today; useful error-corrected computation requires roughly one million
• Current superconducting qubit fabrication is "artisanal" — not yet industrially scalable
• Martinis's company is applying established semiconductor fabrication tools to close that gap
• Analogy: Nvidia's value came from owning the hardware layer before the use cases were obvious
• Algorithm work is cheap and abundant; scalable hardware is scarce and defensible

The encryption threat is real and near

• Google's 2024 paper: a quantum computer could crack Bitcoin encryption in nine minutes using 20x fewer resources than previously estimated
• Shor's algorithm — capable of breaking RSA — was published in the early 1990s; governments have known about this threat for over a decade
• NIST has run a decade-long program producing downloadable quantum-safe cryptography standards
• Google already deploys quantum-resistant protocols on portions of its traffic
• Martinis's company is briefing the US Treasury on unclaimed Bitcoin at risk from early-generation quantum machines

Timeline and who is exposed first

• Martinis: five to ten years to a machine capable of breaking current encryption — described as an optimistic but credible scenario
• Google CEO publicly cites three to five years (incentivized to compress the timeline)
• IBM independently quoted similar numbers at a recent industry meeting
• Most exposed: old Bitcoin wallets with static public keys, unregulated crypto, private systems outside major cloud providers
• Least exposed: large tech firms already migrating to quantum-safe protocols

Career and mindset lessons from Martinis's trajectory

• Being pushed out of Google's quantum supremacy project freed him to rethink architecture from scratch
• His framework: definite optimism (Peter Thiel's Zero to One) — know exactly what to build, not just that something good will emerge
• Repeated career pivots came through negative events; setbacks consistently opened more valuable directions
• Nobel call arrived at 2:30 a.m.; his wife held off reporters and let him sleep until 6 a.m.
• His advice to founders: pick one hard, concrete problem — better qubits — and hold to it regardless of pivot pressure