Quantum Resource Estimator (Surface Code)
Estimate fault-tolerant resources with the standard surface-code model: choose the smallest code distance that keeps the total logical failure probability under your target, then derive physical qubits and run time.
Results
- Code distance d
- 21estimated
- Logical error per qubit per round
- 1.00e-12estimated
- Total failure probability
- 2.10e-3estimated
- Physical qubits per logical qubitRotated surface code: d² data + d² − 1 measurement
- 881calculated
- Total physical qubits
- 1,32,150estimated
- Run timeLogical depth × d code cycles
- 21 sestimated
These are order-of-magnitude planning estimates for research discussion, not hardware specifications.
What it calculates
- Required code distance
- Logical error rate per qubit per round
- Physical qubits
- Run time
Worked example
Using the default inputs below; change any input above to recalculate.
| Logical qubits | 100 |
|---|---|
| Logical depth (logical time steps) | 1000000 |
| Physical error rate | 0.001 |
| Threshold error rate | 0.01 |
| Acceptable total failure probability | 0.01 |
| Layout overhead factor | 1.5 |
| Magic-state factories | 0 |
| Physical qubits per factory | 0 |
| Code cycle time | 1 µs |
| Code distance d | 21 | estimated |
|---|---|---|
| Logical error per qubit per round | 1.00e-12 | estimated |
| Total failure probability | 2.10e-3 | estimated |
| Physical qubits per logical qubit | 881 | calculated |
| Total physical qubits | 1,32,150 | estimated |
| Run time | 21 s | estimated |
Methodology
Below threshold, the surface code's logical error rate per qubit per round falls exponentially with distance: p_L ≈ 0.1 × (p/p_th)^((d+1)/2) (Fowler et al., 2012). Each logical time step takes about d code cycles.
The smallest odd d is chosen such that p_L × logical qubits × logical depth × d stays under the target failure probability. A rotated surface-code patch uses 2d² − 1 physical qubits; layout overhead and magic-state factories are added.
Formulas
- Logical error
- p_L ≈ 0.1 (p / p_th)^((d+1)/2)
- Failure
- P_fail ≈ p_L × k × D × d
- Qubits
- Q = k × (2d² − 1) × layout + factories
Assumptions
- Uniform circuit-level noise below threshold.
- Prefactor 0.1 and threshold 1% are common planning values; both are inputs.
Limitations
- Real overheads depend on decoder, connectivity, T-gate count and factory design.