**Adiabatic quantum computation** (**AQC**) is a form of quantum computing which relies on the adiabatic theorem to do calculations^{[1]} and is closely related to quantum annealing.^{[2]}^{[3]}^{[4]}^{[5]}

First, a (potentially complicated) Hamiltonian is found whose ground state describes the solution to the problem of interest. Next, a system with a simple Hamiltonian is prepared and initialized to the ground state. Finally, the simple Hamiltonian is adiabatically evolved to the desired complicated Hamiltonian. By the adiabatic theorem, the system remains in the ground state, so at the end the state of the system describes the solution to the problem. Adiabatic quantum computing has been shown to be polynomially equivalent to conventional quantum computing in the circuit model.^{[6]}

The time complexity for an adiabatic algorithm is the time taken to complete the adiabatic evolution which is dependent on the gap in the energy eigenvalues (spectral gap) of the Hamiltonian. Specifically, if the system is to be kept in the ground state, the energy gap between the ground state and the first excited state of provides an upper bound on the rate at which the Hamiltonian can be evolved at time .^{[7]} When the spectral gap is small, the Hamiltonian has to be evolved slowly. The runtime for the entire algorithm can be bounded by:

where is the minimum spectral gap for .

AQC is a possible method to get around the problem of energy relaxation. Since the quantum system is in the ground state, interference with the outside world cannot make it move to a lower state. If the energy of the outside world (that is, the "temperature of the bath") is kept lower than the energy gap between the ground state and the next higher energy state, the system has a proportionally lower probability of going to a higher energy state. Thus the system can stay in a single system eigenstate as long as needed.

Universality results in the adiabatic model are tied to quantum complexity and QMA-hard problems. The k-local Hamiltonian is QMA-complete for k ≥ 2.^{[8]} QMA-hardness results are known for physically realistic lattice models of qubits such as ^{[9]}

where represent the Pauli matrices . Such models are used for universal adiabatic quantum computation. The Hamiltonians for the QMA-complete problem can also be restricted to act on a two dimensional grid of qubits^{[10]} or a line of quantum particles with 12 states per particle.^{[11]} If such models were found to be physically realisable, they too could be used to form the building blocks of a universal adiabatic quantum computer.

In practice, there are problems during a computation. As the Hamiltonian is gradually changed, the interesting parts (quantum behaviour as opposed to classical) occur when multiple qubits are close to a tipping point. It is exactly at this point when the ground state (one set of qubit orientations) gets very close to a first energy state (a different arrangement of orientations). Adding a slight amount of energy (from the external bath, or as a result of slowly changing the Hamiltonian) could take the system out of the ground state, and ruin the calculation. Trying to perform the calculation more quickly increases the external energy; scaling the number of qubits makes the energy gap at the tipping points smaller.

Adiabatic quantum computation solves satisfiability problems and other combinatorial search problems. Specifically, these kind of problems seek a state that satisfies . This expression contains the satisfiability of M clauses, for which clause has the value True or False, and can involve n bits. Each bit is a variable such that is a Boolean value function of . QAA solves this kind of problem using quantum adiabatic evolution. It starts with an Initial Hamiltonian :

where shows the Hamiltonian corresponding to the clause . Usually, the choice of won't depend on different clauses, so only the total number of times each bit is involved in all clauses matters. Next, it goes through an adiabatic evolution, ending in the Problem Hamiltonian :

where is the satisfying Hamiltonian of clause C.

It has eigenvalues:

For a simple path of adiabatic evolution with run time T, consider:

and let . We then have

, which is the adiabatic evolution Hamiltonian of our algorithm.

According to the adiabatic theorem, we start from the ground state of Hamiltonian at the beginning, proceed through an adiabatic process, and end in the ground state of problem Hamiltonian .

We then measure the z-component of each of the n spins in the final state. This will produce a string which is highly likely to be the result of our satisfiability problem. The run time T must be sufficiently long to assure correctness of the result. According to adiabatic theorem, T is about , where
is the minimum energy gap between ground state and first excited state.^{[12]}

Adiabatic quantum computing is equivalent in power to standard gate-based quantum computing that implements arbitrary unitary operations. However, the mapping challenge on gate-based quantum devices differs substantially from quantum annealers as logical variables are mapped only to single qubits and not to chains.^{[13]}

The D-Wave One is a device made by Canadian company D-Wave Systems, which claims that it uses quantum annealing to solve optimization problems.^{[14]}^{[15]} On 25 May 2011, Lockheed-Martin purchased a D-Wave One for about US$10 million.^{[15]} In May 2013, Google purchased a 512 qubit D-Wave Two.^{[16]}

The question of whether the D-Wave processors offer a speedup over a classical processor is still unanswered. Tests performed by researchers at Quantum Artificial Intelligence Lab (NASA), USC, ETH Zurich, and Google show that as of 2015, there is no evidence of a quantum advantage.^{[17]}^{[18]}^{[19]}