Adiabatic quantum computation
Adiabatic quantum computation
复制标题
DOI：
10.1103/revmodphys.90.015002
复制
发表时间：
2018-01-29
影响因子：
44.1
通讯作者：
Lidar, Daniel A.
中科院分区：
文献类型：
--
作者：
Albash, Tameem;Lidar, Daniel A.
绝热量子计算(AQC)最初是一种解决最优化问题的方法，后来发展成为量子计算标准电路模型的重要通用替代方案，与经典和量子复杂性理论以及凝聚态物理都有着深刻的联系。这篇综述介绍了该领域的主要理论发展，同时重点介绍了封闭系统的设置。回顾围绕一系列主题进行组织，这些主题对于理解AQC的基本原理、它的算法成就和局限性以及它在计算复杂性理论的更一般背景下的范围是至关重要的。给出了AQC的基石绝热定理的几种变体，并给出了具有量子加速比的显式AQC算法的例子。综述了AQC普适性的几种证明以及与之相关的哈密顿量子复杂性理论。相当大的篇幅被用来讨论随机的AQC，这是迄今为止大多数AQC工作的背景，其中讨论了成功的障碍及其可能的解决方案。
Adiabatic quantum computing (AQC) started as an approach to solving optimization problems and has evolved into an important universal alternative to the standard circuit model of quantum computing, with deep connections to both classical and quantum complexity theory and condensed matter physics. This review gives an account of the major theoretical developments in the field, while focusing on the closed-system setting. The review is organized around a series of topics that are essential to an understanding of the underlying principles of AQC, its algorithmic accomplishments and limitations, and its scope in the more general setting of computational complexity theory. Several variants are presented of the adiabatic theorem, the cornerstone of AQC, and examples are given of explicit AQC algorithms that exhibit a quantum speedup. An overview of several proofs of the universality of AQC and related Hamiltonian quantum complexity theory is given. Considerable space is devoted to stoquastic AQC, the setting of most AQC work to date, where obstructions to success and their possible resolutions are discussed.