Quantum Simulation
A first pass. Incomplete by design.
Part of the track Derived, Borrowed, Learned
The argument
Feynman's 1982 paper "Simulating Physics with Computers" made a simple observation. Classical computers approximate quantum systems with effort that grows exponentially in the number of particles, because the state space does. A computer built from quantum components would not have that problem: its state space grows the same way the system's does. Lloyd (1996) turned the observation into a theorem. Any quantum system whose interactions are local can be simulated on a quantum computer with resources that scale polynomially in system size and simulation time.
Why this is the strongest case for quantum advantage
Shor's algorithm depends on a specific mathematical structure. Grover's gives only a square-root gain. Simulation rests on a structural match between the machine and the problem: the equations governing the qubits and the equations governing the molecule have the same form. The precise term is isomorphism; the older term is analog. See Analog Computation and IsomorphismNoteSeedAnalog Computation and IsomorphismAn analog computer is one that is analogous to the problem: the wind tunnel to flight, the tide machine to the sea. When the analogy is exact the word is isomorphism, and a quantum simulator is the deepest example.. On the The Structure GradientNoteSeedThe Structure GradientComputational advantage depends on how much structure a problem has and where the structure comes from: isomorphic (the problem is physics), structural (hidden mathematical regularity), or generic (nothing to exploit). Derived, borrowed, or learned. this is the isomorphic end, where the exponential claims are best supported.
What "the computer becomes the molecule" leaves out
The Hamiltonian of the molecule still has to be written down, mapped onto qubits (Jordan-Wigner or similar encodings), decomposed into gate sequences (Trotterization or newer methods), and run on error-corrected hardware. The modeling step does not disappear; it becomes a translation between two systems that speak the same language. The gap between model and reality closes to engineering overhead rather than to zero.
Applications
Drug discovery, catalysts, battery materials, superconductors. The common feature is that the classical approximations (density functional theory and its relatives) break down exactly where the chemistry is interesting, in strongly correlated electrons.
What this note does not yet cover
- Variational methods (VQE) versus phase estimation.
- Current resource estimates for a chemically interesting molecule (e.g. FeMoco).
- Evidence to date of simulation beyond classical reach.
Review log
- 2026-09-08: seeded from Section VIII of The Resolution of Reality.
Appears in
Essays that draw on this note.
- The Resolution of RealityA primer on quantum computing: how physical law replaces brute-force search, why the advantage depends on how native the problem is to the machine, and where hybrid classical-quantum architectures fit.
Links out
- Analog Computation and IsomorphismAn analog computer is one that is analogous to the problem: the wind tunnel to flight, the tide machine to the sea. When the analogy is exact the word is isomorphism, and a quantum simulator is the deepest example.
- The Structure GradientComputational advantage depends on how much structure a problem has and where the structure comes from: isomorphic (the problem is physics), structural (hidden mathematical regularity), or generic (nothing to exploit). Derived, borrowed, or learned.
Referenced by
Other notes and pages that link here.
- Analog Computation and IsomorphismAn analog computer is one that is analogous to the problem: the wind tunnel to flight, the tide machine to the sea. When the analogy is exact the word is isomorphism, and a quantum simulator is the deepest example.
- Key Quantum Algorithms: Shor, Grover, and SimulationThe three algorithm families that define what quantum computers are for, the speedup each delivers, and why the speedups differ. Originally Appendix D of The Resolution of Reality.
- ReflexivityA model of a market changes the market. Soros's reflexivity, the Lucas critique, and Goodhart's law are three statements of the same limit, and it is the one way markets are permanently harder than chemistry: molecules do not read the paper.
Related
- Key Quantum Algorithms: Shor, Grover, and SimulationThe three algorithm families that define what quantum computers are for, the speedup each delivers, and why the speedups differ. Originally Appendix D of The Resolution of Reality.