I struggled with organic chemistry in college. The course asked me to predict how molecules behave from their structure, and I predicted poorly. The cause could have been the content, the instructor, or me. I will never know but I’m kinda leaning towards me. Things have changed these days - a quantum computer can make predictions from the molecule's energy, and the effort runs into a bottleneck that is easier to identify.
Bacteria turn nitrogen from the air into a form living things can use. The enzyme that does the work, nitrogenase, runs at room temperature and ambient pressure, according to a 2026 resource-estimation study. Its active site is a cluster of iron, molybdenum, sulfur, and carbon atoms called FeMoco. Chemists want FeMoco's energy at high precision, because the energy shows how the reaction proceeds. Classical computers cannot solve it exactly at this size, so FeMoco is a standard target for quantum computers.
The algorithm for that job is quantum phase estimation, or QPE. Every molecule has a Hamiltonian, the mathematical description of its energy. The lowest value is the ground state energy. Alexei Kitaev introduced phase estimation in 1995, and given a state close to the ground state, it reads out the energy as a number. Preparing a good starting state is difficult on its own, but the larger cost comes from the gates the algorithm runs.
A gate is one basic operation on qubits. Quantum computers protect their qubits with error correction (Chapter 4 of Quantum from the Ground Up covers the basics). The machine groups many physical qubits into one logical qubit, which can survive errors in the physical qubits beneath it. A family of gates called Clifford gates runs cheaply on logical qubits. Clifford gates alone cannot perform every calculation. The machine also needs a non-Clifford gate, usually the T gate. A logical T gate consumes a specially prepared resource called a magic state, and preparing it takes extra qubits and many rounds of checking.
The count of T gates sets the cost. The best published QPE estimate for FeMoco needs about 5.3 billion Toffoli gates. A Toffoli is a three-qubit gate requiring seven T gates in standard circuit synthesis (or four with an ancilla), though modern fault-tolerant architectures often cultivate |CCZ⟩ states directly to bypass explicit T-gate expansion. Under standard synthesis, this total is roughly 37 billion T gates. A PennyLane tutorial for a 76-orbital FeMoco model shows a trade-off. One version uses 2,188 logical qubits and 88 billion Toffoli gates. A second version cuts the qubits to 466 and needs 345 billion Toffoli gates. Saving space costs more gates, and every gate adds T gates to the bill.
Distillation was the standard way to make magic states. It combines many noisy magic states into one cleaner state, and the circuits that do this are called T factories. Craig Gidney's 2025 Simons talk cites a 2012 analysis that put T factories at 94 percent of a quantum computation. That share made magic states the main target for cost reduction.
Chapter 6 of the book covers one alternative to brute-force distillation. In August 2026, a Quantinuum and UC Davis team used code switching to build a trustworthy magic state from 28 physical qubits instead of hundreds. The state's logical infidelity came out about 2.7 times lower than the error rate of the physical qubits that built it. Cultivation takes a different route to the same goal.
In 2024, Gidney, Shutty, and Jones proposed magic state cultivation. It builds up one magic state inside a single error-correcting patch, checks the state at each stage, and discards any attempt that fails. At a physical error rate of 0.1 percent, it reaches a logical error rate near 2 in a billion using about an order of magnitude fewer qubit-rounds than earlier methods. A qubit-round is one qubit held for one round of error correction, so the measure combines space and time. The authors suggest distillation may become unnecessary. Google tested cultivation on a superconducting processor in December 2025. The error dropped by a factor of 40, the state fidelity reached 0.9999, and 8 percent of attempts survived. The remaining 92 percent were discarded during early-stage syndrome checks. This post-selection converts a spatial footprint penalty into a temporal retry delay. Factory duty-cycle and retry latency become the primary runtime bottlenecks.
![]() |
| From a molecule’s energy to the magic states every T gate consumes, with three ways to make them. |
Lower T-gate cost moves chemistry closer. A March 2026 study estimates that chemically accurate QPE for active spaces of 20 to 50 spatial orbitals is feasible on early fault-tolerant machines with about 100,000 physical qubits, with runtimes of days to weeks. An active space is the set of orbitals the calculation treats exactly, and chemical accuracy is the precision chemists need to predict reactions. Exact classical methods like Full Configuration Interaction (FCI) exponentially stall beyond 22 spatial orbitals, making 20-to-50 orbital strongly correlated systems the primary domain for early quantum advantage.
The same T-gate cost applies to cryptography. Chapter 13 of Quantum from the Ground Up cites Gidney's 2025 estimate that RSA-2048 falls to fewer than one million noisy qubits in under a week, then reports that the figure did not survive spring 2026. An Oratomic estimate cited there puts RSA-2048 within reach of as few as 10,000 qubits on a neutral atom machine. Part of Gidney's reduction came from using cultivation to shrink the space for magic state production. Progress on the T gate therefore shortens the timeline for chemistry and for breaking encryption. The September 2026 edition covers code switching in Chapter 6. The next quarterly edition of the book will add cultivation and the T-gate budget for chemistry.
I still cannot say for sure whether the content, the instructor, or I caused my trouble with organic chemistry but still.... kinda leaning towards me.







.png)

