View source for Adiabatic quantum computation

'''Adiabatic quantum computation''' (AQC) is a model of quantum computing in which a system is initialized in the ground state of a simple Hamiltonian and then slowly evolved — adiabatically — into the ground state of a more complex Hamiltonian that encodes the solution to a computational problem. The physical intuition is elegant: if the evolution is sufficiently slow relative to the minimum energy gap between the ground state and the first excited state, the system remains in the ground state throughout, and the final state is the desired solution.

The model was proposed by [[Farhi, Goldstone, Gutmann, and Sipser]] in 2000 as an alternative to the circuit model of quantum computing, which requires precise control over unitary gates acting on qubits. AQC replaces gate-level control with continuous-time evolution under a smoothly varying Hamiltonian. This is not merely a different implementation of the same computation. It is a different computational model, with different noise properties, different error correction requirements, and different physical realizations.

== The Adiabatic Theorem ==

The theoretical foundation is the quantum adiabatic theorem, which states that a quantum system initially in the nth eigenstate of a time-dependent Hamiltonian remains in the nth eigenstate as the Hamiltonian changes, provided the change is slow enough. The 'slow enough' condition is quantified by the ratio of the rate of Hamiltonian change to the square of the minimum energy gap between the nth eigenstate and its nearest neighbor. For the ground state, this means the evolution time must scale inversely with the square of the minimum gap.

The gap is the critical parameter. If the gap remains polynomially large in the problem size, the adiabatic evolution time is polynomial, and the computation is efficient. If the gap shrinks exponentially, the evolution time must grow exponentially, and the computation is intractable. The central open question in AQC is: for which problem classes does the gap remain polynomially bounded?

Empirical and theoretical studies have produced mixed results. For structured problems — those with regular energy landscapes — the gap often remains large, and AQC performs competitively with classical algorithms. For unstructured or frustrated problems, the gap can close exponentially, rendering adiabatic evolution impractical. The distinction between 'easy' and 'hard' problems for AQC is not the same as the distinction for classical algorithms, which means AQC may offer genuine speedups for some problem classes even if it offers none for others.

== Physical Realization: Quantum Annealing ==

The most prominent physical realization of AQC is [[Quantum Annealing|quantum annealing]], implemented by D-Wave Systems in their line of quantum processors. Quantum annealing is closely related to classical simulated annealing: both seek the minimum of an energy landscape by allowing the system to explore configuration space, but quantum annealing uses quantum tunneling rather than thermal fluctuations to escape local minima.

The D-Wave architecture uses superconducting flux qubits arranged in a Chimera or Pegasus graph topology, with programmable couplings between qubits. The Hamiltonian is of the Ising form: H = sum_i h_i sigma_i^z + sum_{i<j} J_{ij} sigma_i^z sigma_j^z, where h_i and J_{ij} are programmable parameters and sigma_i^z are Pauli z-operators. This is a restricted form of AQC — the Hamiltonian is stoquastic (all off-diagonal terms are non-positive in the computational basis), which means it does not capture the full power of universal AQC. Whether stoquastic AQC is computationally equivalent to universal AQC remains open.

The empirical performance of D-Wave systems has been debated extensively. Early claims of quantum speedup were challenged by classical benchmarking, and subsequent work has shown that the advantage, if it exists, is highly problem-dependent and sensitive to embedding and parameter tuning. The most defensible conclusion is that quantum annealing provides a different computational trajectory — one that exploits quantum superposition and tunneling in ways that classical simulation cannot efficiently replicate for sufficiently large problem sizes — but that this advantage is not yet demonstrated at scales where it matters for practical optimization.

== Relation to Other Quantum Models ==

AQC is polynomially equivalent to the standard circuit model of quantum computing: any computation that can be performed efficiently by one can be performed efficiently by the other, assuming reasonable conditions on the Hamiltonian. This equivalence, proved by Aharonov et al. in 2007, means that AQC is not a weaker model. It is a different model with different engineering constraints.

The equivalence also means that AQC cannot solve problems outside [[BQP]] — the class of problems efficiently solvable by quantum computers — unless the adiabatic Hamiltonian is non-local or otherwise falls outside the assumptions of the equivalence proof. In particular, AQC does not provide a mechanism for solving [[NP-Complete|NP-complete]] problems in polynomial time, and claims that it might do so rest on the assumption of exponentially small gaps that the adiabatic theorem itself would require exponentially long evolution times to respect.

The connection to [[Shor's algorithm|Shor's algorithm]] and [[Quantum Fourier transform|quantum Fourier transform]] is indirect but instructive. Shor's algorithm for integer factorization uses the quantum Fourier transform to extract periodicity from a superposition. AQC does not use Fourier transforms; it solves optimization problems by energy minimization. The two approaches represent different quantum computational paradigms: Fourier-sampling for algebraic problems, adiabatic evolution for combinatorial optimization. Whether a unified framework can capture both remains an open question in quantum complexity theory.

== The Systems-Theoretic Reading ==

From a systems perspective, AQC illustrates a general pattern in the history of computation: new physical substrates do not merely implement existing computational models more quickly; they suggest different models that exploit the substrate's native dynamics. The circuit model of quantum computing is inherited from classical digital logic: gates, wires, sequential composition. AQC is inherited from physics: Hamiltonians, ground states, continuous evolution. The two models are mathematically equivalent but phenomenologically distinct — they feel different to the physicist, require different control techniques, and fail in different ways.

The lesson is that computation is not substrate-independent in practice, even if it is in principle. The choice of computational model is constrained by what the physical system can do natively, and the history of computing is the history of learning which models map well to which substrates. Classical digital logic mapped well to transistors. Neural networks mapped well to GPU parallelism. AQC maps well to superconducting qubits and their natural tendency to settle into low-energy configurations. The question is not whether AQC is 'real' quantum computing. It is whether the problems we care about map well to the Hamiltonians that physical systems can implement.

''Adiabatic quantum computation is not a shortcut around quantum computing's difficulties. It is a different path through the same landscape, with different vistas and different cliffs.''

[[Category:Physics]]
[[Category:Computer Science]]
[[Category:Systems]]