**绝热量子计算机** (**AQC**)是一种量子计算机的形式，依赖绝热理论（英语：）进行计算 。AQC与量子退火紧密相关，甚至可认为是量子退火的一个子类。

描述
--

首先要找到一个基态能够描述我们所感兴趣的问题的解的哈密顿量（这个量可能是复杂的）。接下来准备一个简单哈密顿量的系统并将其初始化至基态。最后，将该简单哈密顿量绝热演化为我们所求的复杂哈密顿量.。根据绝热理论，该系统会保持在基态，所以最终该系统所处的状态将可以描述该问题的解。绝热量子计算在多项式运算方面展示出了和传统量子计算一样的能力。

绝热量子计算的时间复杂度是指完成绝热演算所需的时间，与哈密顿量的本征能隙（谱隙）有关。具体地说，如果系统处于基态，基态与第一激发态之间的能隙提给出了演化速度的上界当谱隙很小时，演化速度也会很慢。 整个算法的运行时间可以被约束为：

{\displaystyle T=O\left({\frac {1}{g\_{min}^{2}}}\right)}

这里{\displaystyle g\_{min}}代表{\displaystyle H(t)}的最小频谱距 。

AQC是一个可能解决量子耗散问题的方法。由于系统处于基态，外界的干涉无法使它向更低的能态移动。如果外界的能量低于基态和第一激发态的能量差，系统跃迁的高能态的可能性将相应的更低。 因此，系统可以依据需求长时间处于单系统本征态。

普遍来讲，在绝热模型中的结果依赖于量子复杂性和QMA-问题。如果k≥2， k-local的哈密顿量是QMA完备的 QMA难度的结果已知于量子比特的现实晶格模型 ， 。

{\displaystyle H=\sum \_{i}h\_{i}Z\_{i}+\sum \_{i<j}J^{ij}Z\_{i}Z\_{j}+\sum \_{i<j}K^{ij}X\_{i}X\_{j}}

{\displaystyle Z,X}代表泡利矩阵{\displaystyle \sigma \_{z},\sigma \_{x}}.这种模型被用于通用绝热量子计算。QMA-完备问题的哈密顿量也可以被限制作用在量子比特的两维网格上或一条每个有12种状态的量子颗粒上。如果这种模型被证明是物理可行的，它们也可以用来构建通用绝热量子计算机的基础。

在实际计算中仍存在一些问题。因为哈密顿量是逐渐变化，当多个 量子比特接近一个临界点时会产生一些有趣的现象。临界点是指当基态能量很接近第一激发态时。这时，只需要添加少量的能量（来自外界环境或是由于哈密顿量的改变）就能使系统脱离基态从而破坏计算。试图加快计算速度会增加外部能量；改变量子比特的数量会使临界点处能隙变小。

绝热量子计算的可满足性问题
-------------

已隱藏部分未翻譯内容，歡迎參與翻譯。
Adiabatic quantum computation solves satisfiability problems and other combinatorial search problems by the process below. Generally this kind of problem is to seek for a state that satisfies
{\displaystyle C\_{1}\wedge C\_{2}\wedge \cdots \wedge C\_{M}}.
This expression contains the satisfiability of M clauses, each clause C\_i has the value True or False, and can involve n bits. Each bit here is a variable {\displaystyle x\_{j}\in \{0,1\}} so C\_i is a Boolean value function of x\_{1},x\_{2},\dots ,x\_{n}. QAA solves this kind of problem using quantum adiabatic evolution. It starts with an Initial Hamiltonian H\_{B}:

where {\displaystyle H\_{B\_{i}}} shows the Hamiltonian corresponding to the clause C\_i, usually the choice of {\displaystyle H\_{B\_{i}}} won't depend on different clauses, so only the total number of times each bit involved in all clauses matters. Then it goes through an adiabatic evolution, ending in the Problem Hamiltonian {\displaystyle H\_{P}}:

{\displaystyle H\_{P}=\sum \limits \_{C}^{}H\_{P,C}}

where {\displaystyle H\_{P,C}} is the satisfying Hamiltonian of clause C. It has eigenvalues:

{\displaystyle h\_{C}(z\_{1C},z\_{2C}\dots z\_{nC})={\begin{cases}0&{\mbox{clause }}C{\mbox{ satisfied}}\\1&{\mbox{clause }}C{\mbox{ violated}}\end{cases}}}

For a simple path of Adiabatic Evolution with running time T, consider:
{\displaystyle H(t)=(1-t/T)H\_{B}+(t/T)H\_{P}}
and let {\displaystyle s=t/T}, we have:
{\displaystyle {\tilde {H}}(s)=(1-s)H\_{B}+sH\_{P}},
which is the adiabatic evolution Hamiltonian of our algorithm.

According to the adiabatic theorem, we start from the ground state of Hamiltonian H\_{B} at beginning, go through an adiabatic process, and at last ending in the ground state of problem Hamiltonian {\displaystyle H\_{P}}. Then we measure the z-component of each of the n spins in the final state, this will produce a string {\displaystyle z\_{1},z\_{2},\dots ,z\_{n}} which is highly likely to be the result of our satisfiability problem. Here the running time T must be sufficiently long to assure the correctness of result, and according to adiabatic theorem, T is about {\displaystyle \varepsilon /g\_{\mathrm {min} }^{2}}, where
{\displaystyle g\_{\mathrm {min} }=\min \_{0\leq s\leq 1}(E\_{1}(s)-E\_{0}(s))}
is the minimum energy gap between ground state and first excited state.

D-波量子处理器
--------

The D-Wave One is a device made by a Canadian company D-Wave Systems which describes it as doing quantum annealing. In 2011, Lockheed-Martin purchased one for about US$10 million; in May 2013, Google purchased a D-Wave Two with 512 qubits. As of now, 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 now, there is no evidence of a quantum advantage.