RSA-2048 with Gidney's 2025 algorithm
In 2025 Craig Gidney cut the published cost of factoring RSA-2048 from 20 million noisy qubits to under one million, at the price of a longer run (under a week). This page runs his logical-level figures through the standard surface-code model so you can see how much of the saving comes from the algorithm and how much from newer error-correction tricks.
How many qubits does Gidney's 2025 RSA-2048 algorithm need?
Using 1,399 logical qubits and 6.50 billion Toffoli gates, a surface-code machine at 0.1% physical error and 1 microsecond cycles needs code distance 27, about 3.56 million - 4.49 million physical qubits, and runs for about 2.03 days (serial depth). Order-of-magnitude planning estimate.
| Physical error rate | Hardware | Code distance | Physical qubits | Runtime |
|---|---|---|---|---|
| 0.1% | superconducting, 1 µs | 27 | 3.56 million - 4.49 million | 2.03 days |
| 0.05% | superconducting, 1 µs | 21 | 2.16 million - 2.71 million | 38 hours |
| 0.01% | superconducting, 1 µs | 13 | 826,072 - 1.04 million | 23 hours |
| 0.001% | superconducting, 1 µs | 9 | 395,928 - 498,604 | 16 hours |
| 0.1% | trapped ion, 200 µs | 27 | 3.56 million - 4.49 million | 406 days |
| 0.05% | trapped ion, 200 µs | 21 | 2.16 million - 2.71 million | 316 days |
| 0.01% | trapped ion, 200 µs | 13 | 826,072 - 1.04 million | 196 days |
| 0.001% | trapped ion, 200 µs | 9 | 395,928 - 498,604 | 135 days |
Try your own assumptions
Highlighted share: magic-state factories (conservative bound shown).
How the model works and where every constant comes from: methodology and sources.