Fault-Tolerant Chemistry: Resource Estimates
What it really takes to beat classical chemistry.
"Quantum computers will simulate FeMoco" is a slogan. A resource estimate turns it into numbers: how many logical qubits, how many Toffoli gates, what code distance, how many physical qubits, how many days. Between 2017 and 2021 better algorithms cut the estimated gate counts by orders of magnitude, and the arithmetic behind those numbers is worth knowing by heart.
What you’ll learn
- Describe the pipeline of a fault-tolerant resource estimate and explain why the Toffoli (or T) count dominates.
- Derive the eigenphases of the qubitization walk operator and the resulting cost walk steps.
- Explain how single factorization, double factorization and tensor hypercontraction lower and the cost per step.
- Convert Toffoli counts and logical-qubit counts into code distance, physical qubits and runtime for a surface-code architecture.
- Assess claims of chemical quantum advantage in light of initial-state overlap and classical progress.
What a resource estimate counts
On a surface-code machine, Clifford operations are comparatively cheap (lattice surgery, Pauli frame tracking), while each non-Clifford gate consumes a magic state distilled in a dedicated factory occupying many physical qubits for many code cycles. A Toffoli costs four T gates with an ancilla (seven without), or one state from a dedicated factory. So estimates report two headline numbers: logical qubits and Toffoli (or T) count. Everything physical follows from these plus the hardware error rate.
| Stage | Choices | What it determines |
|---|---|---|
| Model | basis set, active space (e.g. 54 electrons in 54 orbitals) | system qubits (one per spin-orbital) and the coefficients of |
| Representation | Pauli sum, single or double factorization, tensor hypercontraction | the 1-norm and the cost of PREPARE and SELECT |
| Algorithm | qubitized phase estimation | about walk steps |
| Compilation | Clifford + Toffoli, QROM data loading | Toffoli count and logical qubits |
| Error correction | surface code, magic-state factories, routing | code distance, physical qubits, wall-clock time |
Qubitization: the cost is set by λ
Write the Hamiltonian as a linear combination of unitaries with (absorb signs into the unitaries, e.g. Pauli strings) and define the 1-norm . Two oracles do the work:
Then : a block encoding of .
The block-encoding identity applied to an eigenvector.
Split into its part inside and outside the image of .
is Hermitian and unitary, so on this plane it is a reflection; fixes and flips .
Two reflections make a rotation, exactly as in Grover's algorithm. The energy is encoded in the rotation angle .
Phase estimation of to precision needs applications of ; with the standard Heisenberg-limited variant the count is about (Babbush et al. 2018).
Take a Hamiltonian with hartree and a target precision of mHa. About how many walk steps (in thousands) does qubitized phase estimation need?
Show the answer
98 thousand
. Multiply by the Toffoli cost of one walk step, typically thousands to tens of thousands for large active spaces, and you land between and Toffolis. Halving halves the runtime.
| Representation | Idea | Effect |
|---|---|---|
| Pauli (sparse) LCU | with terms | simple; large and costly PREPARE |
| Single factorization | Cholesky / density fitting: , rank in practice | fewer data to load |
| Double factorization | diagonalize each one-body factor: | lower ; orbital rotations via Givens circuits |
| Tensor hypercontraction | lowest published Toffoli counts for FeMoco (Lee et al. 2021) |
From logical to physical
A standard heuristic for the surface code at physical error rate below the threshold : the logical error per logical qubit per code cycle is
and a distance- patch uses about physical qubits. The whole computation must finish with total failure probability of order a percent.
Assume 1 μs code cycles and Toffolis consumed one after another, each taking about 25 cycles (the order of the code distance).
The spacetime volume that must survive.
Total failure probability about 1%.
At , so . Distances are odd.
Several million physical qubits for a few days: the same ballpark as published FeMoco estimates, which report a few million physical qubits and runtimes of days under similar assumptions (Lee et al. 2021).
Same model with and . Which (odd) code distance first achieves ?
Show the answer
27
requires , so , about physical qubits per logical qubit. Each extra factor of 10 in required reliability costs only 2 in distance: the exponential suppression that makes fault tolerance viable.
When does quantum actually win?
The overlap is where the debate lives. For weakly coupled fragments, a product trial state with overlap per fragment has total overlap , exponentially small in system size (an orthogonality catastrophe). Lee et al. (2023) argued that in the regimes where a classically computable trial state has good overlap, classical heuristics also tend to work, and found no conclusive evidence of exponential advantage for ground-state chemistry across the systems they examined, while leaving room for large polynomial speedups.
The time scale matters too. Babbush et al. (2021) estimated that each error-corrected non-Clifford operation runs many orders of magnitude slower than a classical operation, so quadratic speedups need impractically long runs to pay off. Chemistry is attractive precisely because its speedups, where they exist, are much larger than quadratic.
Think first A press release says a quantum algorithm needs "only 4,000 qubits" for a chemistry problem. What should you ask?
Logical or physical? At each logical qubit costs on the order of physical qubits, plus factories and routing. Also ask: what Toffoli count and runtime, what precision , what active space and basis, what trial state and overlap, and how the result compares with the best classical method (DMRG, coupled cluster, AFQMC) on the same model.
Key takeaways
- Fault-tolerant estimates headline logical qubits and Toffoli/T count; magic-state distillation makes non-Clifford gates the dominant cost.
- Qubitization turns a block encoding of into a walk with eigenphases ; phase estimation then needs about steps, so is the key figure of merit.
- Single and double factorization and tensor hypercontraction cut and the cost per step, lowering FeMoco-class estimates from the 2017 Trotter numbers to roughly – Toffolis.
- Surface-code arithmetic (, qubits per patch) turns that into millions of physical qubits and days of runtime at .
- Advantage hinges on trial-state overlap and on classical competition; the strongest cases have speedups far larger than quadratic.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
In qubitized phase estimation, the number of walk steps for precision is about . What is ?
- The spectral norm
- The 1-norm of the LCU coefficients
- The number of terms
- The spectral gap
Show the answer
B. The 1-norm of the LCU coefficients
The block encoding represents with . The walk encodes , so energy resolution needs angle resolution . Factorizations aim to shrink toward .
With , what are the eigenvalues of the qubitization walk on the invariant plane associated with ?
Show the answer
D.
On the plane, and are reflections, and their product is a rotation by , with eigenvalues .
Why do fault-tolerant chemistry estimates headline the Toffoli (or T) count rather than the CNOT count?
- Non-Clifford gates require magic-state distillation, which dominates the spacetime cost of the computation
- CNOTs cannot be performed on surface-code qubits
- Toffolis are needed only for the QFT
- CNOT counts are always smaller than Toffoli counts
Show the answer
A. Non-Clifford gates require magic-state distillation, which dominates the spacetime cost of the computation
In the surface code, Clifford gates are implemented by lattice surgery or tracked in software, while each non-Clifford gate consumes a distilled magic state from a large factory. Toffoli or T count is therefore the best single proxy for runtime and footprint.
With , and a target , how does the required odd distance change if the physical error rate improves from to ?
- From 27 to 25
- From 27 to 13
- From 27 to 21
- It does not change
Show the answer
C. From 27 to 21
At : , so . At : needs , so and . Physical qubits per logical patch drop from about 1460 to about 880: better hardware compounds.
Further reading
- M. Reiher, N. Wiebe, K. M. Svore, D. Wecker & M. Troyer, "Elucidating reaction mechanisms on quantum computers", PNAS 114, 7555 (2017).
- G. H. Low & I. L. Chuang, "Hamiltonian simulation by qubitization", Quantum 3, 163 (2019).
- V. von Burg, G. H. Low, T. Häner, D. S. Steiger, M. Reiher, M. Roetteler & M. Troyer, "Quantum computing enhanced computational catalysis", Phys. Rev. Research 3, 033055 (2021).
- J. Lee, D. W. Berry, C. Gidney, W. J. Huggins, J. R. McClean, N. Wiebe & R. Babbush, "Even more efficient quantum computations of chemistry through tensor hypercontraction", PRX Quantum 2, 030305 (2021).
- S. Lee et al., "Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry", Nat. Commun. 14, 1952 (2023).