20,000-qubit trapped-ion quantum computer could break 256-bit ECC in 26 days
jedisct1 · x · 2026-09-09
A new paper by Nicolas Delfosse and colleagues shows how their Walking Cat Architecture for a trapped-ion quantum computer could solve the 256-bit elliptic curve discrete logarithm problem on secp256k1 (the curve used by Bitcoin) in 26 days using 20,000 physical qubits via Shor's algorithm.
Key optimizations include:
- Building on Schrottenloher's recent circuits to reach a logical circuit of 1,450 logical qubits and 40 million Toffoli gates, with a rigorous success probability lower bound holding with confidence at least 1-2^-128
- A CCZ magic-state factory 31x faster, plus frame cleaning via logical CliNR, mobile cat bundles, and integrated routing with strong algorithmic bounds
- A custom compilation toolchain compiling components into measurement schedules obeying architectural constraints to estimate logical depth and physical qubit counts
The work demonstrates application-specific optimization of fault-tolerant quantum computing and directly threatens the elliptic-curve cryptography securing blockchains today.
More from Research
- KANLab: an interactive browser playground for Kolmogorov-Arnold Networks — Lukas Niehaus · 2026-10-27
- CMU's LLM2Cert synthesizes stability certificates verified via SMT and Lean — CarnegieMellonU · 2026-10-27
- NVIDIA open-sources FLORA, a robotics data engine ~125x cheaper than GPT-6 Astra — nvidia · 2026-10-27
- RSNA 2026 Deep Learning Labs return: eight hands-on AI classes over four days in Chicago — PRouzrokh · 2026-10-27
- Steering two orthogonal concept neurons makes a model compose "gnome" — Sauers_ · 2026-10-27
- Paper: data schedules and learning rate schedules should be designed together — alifcoder · 2026-10-27