Diabatic quantum annealing for the frustrated ring model
Diabatic quantum annealing for the frustrated ring model
复制标题
受挫环模型的非绝热量子退火
DOI：
10.1088/2058-9565/acfbaa
复制
发表时间：
2023
影响因子：
6.7
通讯作者：
Albash, Tameem
中科院分区：
文献类型：
--
作者：
Côté, Jeremy;Sauvage, Frédéric;Larocca, Martín;Jonsson, Matías;Cincio, Lukasz;Albash, Tameem
量子退火（QA）是一种求解或近似求解经典优化问题的连续时间启发式量子算法。该算法使用一个时间表，以插入一个易于准备的基态和一个问题的哈密顿的基态编码的解决方案的优化问题的驱动程序之间的哈密顿。标准的实现依赖于绝热的演化：以高概率保持系统处于瞬时基态，并且需要与瞬时基态和激发态之间的最小能隙成反比的时间尺度。然而，绝热演化可以导致演化时间与系统大小成指数级，即使对于计算简单的问题。在这里，我们研究是否非绝热演化与优化的退火时间表可以绕过这种指数放缓一类问题称为挫折环模型。对于充分优化的退火时间表和高达39个量子位的系统大小，我们提供了数值证据，证明我们可以避免指数减速。我们的工作突出了高度可控的QA的潜力，以规避与QA的标准实施相关的瓶颈。
Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.
DOI：
--
发表时间：
2006
期刊：
--
影响因子：
--
作者：
Iroon Polytechniou-
通讯作者：
Iroon Polytechniou-