Skip to main content

Electronic structure on fault-tolerant computers (catalysts such as FeMoco)

Algorithms and benchmarks / Chemistry and materials

Computes energies of molecules and materials to chemical accuracy where classical methods struggle, such as the iron-molybdenum cofactor (FeMoco) of nitrogenase, which fixes nitrogen in nature. It combines Hamiltonian simulation with phase estimation.

Era
Fault-tolerant
Problem class
Chemistry and materials
Speedup
Expected exponential for strongly correlated systems where classical methods scale badly; no general proof.

How it works

The electronic Hamiltonian in a chosen basis of orbitals is encoded (for example with tensor hypercontraction to cut its cost), and phase estimation of the qubitized walk operator returns the ground-state energy.

Typical use cases

  • Catalysts, batteries and drug molecules.
  • Materials for carbon capture.

Documented use cases on related problems

From the use case directory; the sources of these cases may use other methods than this one.

Resource estimates

Figures exactly as stated by their authors, with their assumptions. They are estimates under those assumptions, not forecasts, and they tend to fall as methods improve.

Ground-state energy of FeMoco (2021, peer-reviewed)
QuantityValue as stated
Physical qubitsabout four million
Runtimeunder four days

Assumptions: Tensor hypercontraction representation of the Hamiltonian, a 1 microsecond cycle time and a physical gate error rate of at most 0.1%.

Source: J. Lee et al. 2021, PRX Quantum 2, 030305 (2021); arXiv:2011.03494

Demonstrations

  • 2020: Hartree-Fock calculations on a superconducting processor with up to a dozen qubits, 78 two-qubit and 114 one-qubit gates, for hydrogen chains and the isomerisation of diazene (a test of a building block, not of fault-tolerant chemistry). (F. Arute et al. 2020)

Hardware platforms that fit

  • Superconducting qubits: The cited FeMoco estimate assumes a 1 microsecond cycle and at most 0.1% physical gate error, in line with surface-code superconducting architectures (Lee et al. 2021).

What you need to run it

Classical simulation
Classical chemistry methods remain the baseline; state-vector simulation of the quantum algorithm is limited to small molecules.
Noisy hardware (NISQ)
Not applicable for this family.
Fault-tolerant machine
For FeMoco under the cited assumptions, about four million physical qubits for under four days.
Annealer or analogue simulator
Not applicable for this family.

Calculate the memory of a simulation

Where to run it in Europe

Superconducting qubits

The full infrastructure catalogue · The infrastructure deployment tracker

Software

European tools in the software directory

Other open-source frameworks

  • OpenFermion (Google Quantum AI (United States); non-European)

A listing is not an endorsement; check each tool for the features you need.

Limitations and open questions

  • Estimates depend on the model of the molecule and the target accuracy; Reiher et al. (2017) gave detailed estimates for nitrogenase, and Lee et al. (2021) cut the cost with tensor hypercontraction.
  • A good initial state is needed for phase estimation.

In the Quantum Algorithm Zoo

Index: the Quantum Algorithm Zoo by Stephen P. Jordan, last updated 2026-09-10, checked 2026-10-23. The portal links to it and copies no description from it. Browse the full Quantum Algorithm Zoo (external site)

Named in European procurements

None of the procurement documents read for this release names it.

Sources

  1. M. Reiher, N. Wiebe, K. M. Svore, D. Wecker, M. Troyer (2017). Elucidating Reaction Mechanisms on Quantum Computers. PNAS 114, 7555 (2017); arXiv:1605.03590. Read: abstract page, retrieved 2026-10-23.
  2. J. Lee, D. W. Berry, C. Gidney, W. J. Huggins, J. R. McClean, N. Wiebe, R. Babbush (2021). Even more efficient quantum computations of chemistry through tensor hypercontraction. PRX Quantum 2, 030305 (2021); arXiv:2011.03494. Read: abstract page, retrieved 2026-10-23.
  3. F. Arute et al. (2020). Hartree-Fock on a superconducting qubit quantum computer. Science 369, 1084 (2020); arXiv:2004.04174. Read: abstract page, retrieved 2026-10-23.