RSA-4096: what Shor's algorithm would cost
RSA-4096 is often chosen as a "safer" key size. Shor's algorithm scales polynomially, so doubling the key size from 2048 bits buys roughly 8x more gates and 2x more logical qubits, not security against a large quantum computer.
How many qubits does it take to factor RSA-4096?
Using 12,365 logical qubits and 21.5 billion Toffoli gates, a surface-code machine at 0.1% physical error and 1 microsecond cycles needs code distance 31, about 25.8 million - 52.3 million physical qubits, and runs for about 7.71 days (serial depth). Order-of-magnitude planning estimate.
| Physical error rate | Hardware | Code distance | Physical qubits | Runtime |
|---|---|---|---|---|
| 0.1% | superconducting, 1 µs | 31 | 25.8 million - 52.3 million | 7.71 days |
| 0.05% | superconducting, 1 µs | 23 | 14.2 million - 28.8 million | 5.72 days |
| 0.01% | superconducting, 1 µs | 15 | 6.03 million - 12.2 million | 3.73 days |
| 0.001% | superconducting, 1 µs | 9 | 2.17 million - 4.41 million | 2.24 days |
| 0.1% | trapped ion, 200 µs | 31 | 25.8 million - 52.3 million | 4.22 years |
| 0.05% | trapped ion, 200 µs | 23 | 14.2 million - 28.8 million | 3.13 years |
| 0.01% | trapped ion, 200 µs | 15 | 6.03 million - 12.2 million | 2.04 years |
| 0.001% | trapped ion, 200 µs | 9 | 2.17 million - 4.41 million | 448 days |
Try your own assumptions
Physical qubits (total)
Estimated runtime
Code distance
Data-block physical qubits
T-gate count
Physical per logical
Highlighted share: magic-state factories (conservative bound shown).
How the model works and where every constant comes from: methodology and sources.