Adiabatic Quantum Computation
2000Farhi, Goldstone, Gutmann & Sipser's 2000 proposal of adiabatic quantum computation -- a model of quantum computing based on slowly evolving a system's Hamiltonian toward one whose ground state encodes a problem's solution, rather than the circuit model's discrete gates. This is the original conceptual proposal (arXiv:quant-ph/0001106); the more-cited 2001 Science paper by an overlapping author list is a specific demonstration applying the model to random NP-complete problem instances, not the founding paper -- a real correction, not a name change. Basic-vs-Applied framing check: this node covers only the abstract computational model and its complexity-theoretic properties, not D-Wave's commercial adiabatic/annealing hardware, which has its own commercialization path and belongs in the applied tree if tracked.
Originators
- Edward Farhi
- Jeffrey Goldstone
- Sam Gutmann
- Michael Sipser
Landmark Paper
Checked 2026-08-30 — interim signal only, see docs/BASIC_ROADMAP.md Phase 10
Connections
- is proposed mechanism for Quantum Annealingbasis: reasoned
Not a strict precursor edge -- Quantum Annealing's own anchor (Kadowaki & Nishimori, 1998) predates this Basic node's 2000 paper by two years. The relationship is theoretical grounding, not origination: quantum annealing (QA) is standardly framed as the broader, physically-realizable metaheuristic, of which adiabatic quantum computation (AQC) is "a special case ... in which the system, ideally, begins and remains in its ground state throughout the adiabatic evolution." Farhi et al.'s adiabatic theorem is the theoretical mechanism the field -- and D-Wave's own hardware papers, e.g. Johnson et al. 2011, Nature 473 -- invoke to argue why quantum annealing hardware should reach a problem's ground state; the proposed "why it should work" argument, not the historical origin of the annealing technique itself.