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
- Imbens and Wager Propose PLRD, a Regression Discontinuity Estimator With Lower Error — lihua_lei_stat · 2026-09-09
- ECCV 2026 tutorial unifies hallucination detection, uncertainty and adversarial defense for LLMs — abursuc · 2026-09-09
- Yoav Goldberg: 'proof with very little human input' hides a large expert brainstorm pipeline — yoavgo · 2026-09-09
- Mordatch: robot experiments reveal intentionality and awareness in current models — IMordatch · 2026-09-09
- BlackboxNLP 2026 announces keynotes from Ivan Titov, Sheridan Feucht and Michael Hahn — gsarti_ · 2026-09-09
- Schmidhuber: long-context autoregression was cool long before 2016, cites pioneer-credit survey — SchmidhuberAI · 2026-09-09