arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.02410cond-mat.dis-nncond-mat.stat-mechquant-ph
收藏

困难优化问题中能量匹配的量子算法

Quantum algorithm for energy matching in hard optimization problems

C. L. Baldwin, C. R. Laumann

摘要:

我们考虑局域量子动力学解决能量匹配问题的能力:给定一个经典优化问题和一个低能态的实例,找到另一个宏观上不同的低能态。能量匹配在崎岖的优化景观中是困难的,因为给定的状态提供的关于远处地形的信息很少。在这里,我们表明,量子动力学的引入可以提供一个加速本地经典算法在一个大类的硬优化问题。基本的直觉是,隧道允许系统探索优化景观,同时近似保存经典能量,即使在存在大障碍的情况下。特别地,我们研究了自旋玻璃理论中随机p自旋模型的能量匹配。利用微扰理论和数值精确对角化方法,我们证明了引入横向场会导致三个尖锐的动力学相,其中只有一个能解决匹配问题:(1)小场捕获相,在这个小场捕获相中隧穿太弱,系统无法逃离初态附近;(2)大场激发阶段,其中场将系统激发到高能态,有效地忘记了初始的低能量;以及(3)中间隧穿阶段,其中系统成功地实现能量匹配。我们发现,在隧穿阶段,所需的时间来找到遥远的状态的尺度与系统的大小呈指数级,但仍然是指数比简单的经典蒙特卡罗。

英文摘要:

We consider the ability of local quantum dynamics to solve the energy matching problem: given an instance of a classical optimization problem and a low energy state, find another macroscopically distinct low energy state. Energy matching is difficult in rugged optimization landscapes, as the given state provides little information about the distant topography. Here we show that the introduction of quantum dynamics can provide a speed-up over local classical algorithms in a large class of hard optimization problems. The essential intuition is that tunneling allows the system to explore the optimization landscape while approximately conserving the classical energy, even in the presence of large barriers. In particular, we study energy matching in the random p-spin model of spin glass theory. Using perturbation theory and numerical exact diagonalization, we show that introducing a transverse field leads to three sharp dynamical phases, only one of which solves the matching problem: (1) a small-field trapped phase, in which tunneling is too weak for the system to escape the vicinity of the initial state; (2) a large-field excited phase, in which the field excites the system into high energy states, effectively forgetting the initial low energy; and (3) the intermediate tunneling phase, in which the system succeeds at energy matching. We find that in the tunneling phase, the time required to find distant states scales exponentially with system size but is nevertheless exponentially faster than simple classical Monte Carlo.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑