Quantum annealing is an optimization method that uses quantum fluctuations to find the global minimum of a function, applied in hybrid algorithms.Quantum annealing is a heuristic method for solving integer optimization problems, relying on the principles of quantum mechanics. Unlike the classical analog, where crossing a high barrier requires thermal excitation and is random, here quantum tunneling dominates: the system 'passes' through narrow barriers, effectively leaving local minima and striving for the global one. Programming the problem reduces to setting longitudinal fields and couplings in the Ising model.
The idea of quantum annealing dates back to annealing models in neural networks (1989). It was formalized in 1998 by Tadashi Kadowaki and Hidetoshi Nishimori as a quantum version of the simulated annealing method. A practical breakthrough is associated with the development of superconducting circuits: the D-Wave team (founded in 1999) introduced the first commercial 128-qubit annealer in 2011. Theoretical foundations rest on early research on tunneling (Leo Esaki, 1958) and adiabatic evolution.
Qubits (superconducting loops with Josephson junctions) form an array described by the Ising model with longitudinal fields h_i and couplings J_ij. Initialization is a deep transverse field Γ, creating a superposition of all binary states. Then Γ is smoothly turned off, and h_i and J_ij are turned on. Evolution is governed by the adiabatic condition: τ ≫ max_t |⟨1(t)|∂H/∂t|0(t)⟩| / (E_1(t)−E_0(t))^2, requiring the annealing time τ to be much larger than the inverse square of the minimum energy gap. The tunneling amplitude is exponentially suppressed with increasing barrier width, so for wide barriers, classical algorithms can compete.
D-Wave's hardware quantum annealers solve routing, financial forecasting, and material cutting problems, finding optimal combinations faster than conventional servers for special classes of problems.
The D-Wave Advantage processor with 5000+ qubits solves some quadratic optimization problems in milliseconds, while a classical supercomputer would take hours for the same — but only for specially crafted instances.

















