Quantum Outpost

Algorithm Zoo · Optimization

Adiabatic Quantum Optimization

Also known as: Quantum annealing, AQO

First described: Farhi, Goldstone, Gutmann, Sipser (theory); D-Wave (hardware), 2000

Status: Disputed Maturity: Demonstrated Speedup: Heuristic — none proven for problems of practical interest

The problem

Find low-energy states of an Ising Hamiltonian by slowly interpolating from a trivial Hamiltonian.

Prepare ground state of simple H₀ = -Σ Xi. Slowly interpolate H(s) = (1-s)H₀ + s H_problem over time t_f. Adiabatic theorem: ground state stays in ground state if t_f ≫ 1/min_s(gap(H(s)))².

Best classical

Simulated annealing, SDPs, MILP solvers — generally strong.

Quantum complexity

t_f scaling depends on the minimum gap; can be exponential for hard instances.

Our verdict

The longest-running quantum advantage controversy. Twenty-plus years and the field still cannot point to a single optimization problem where adiabatic quantum optimization (or D-Wave annealing) beats simulated annealing on the same hardware budget. The structure of the problem and the gap behavior matter enormously; generic claims should be ignored.

When to use it

When not to use it

Classical baseline

Simulated annealing (Aaronson, Boixo et al. 2013-2015 controversies). Parallel-tempering Monte Carlo. For most published 'quantum advantage' claims on D-Wave, classical methods produce equal or better solutions in less wall-clock time.

Hardware cost

D-Wave Advantage2: 4,400 qubits but with Zephyr connectivity — non-trivial embedding cost. Effective problem size is much smaller than raw qubit count.

Key papers

Deep-dive tutorials

Last verified: 2026-05-24

Weekly dispatch

Quantum, for people who already code.

One serious tutorial per week, plus the industry moves that actually matter. No hype, no hand-waving.

Free. Unsubscribe anytime. We will never sell your email.