arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.04792quant-phcond-mat.dis-nncond-mat.stat-mechcond-mat.str-el
收藏

量子自旋玻璃中非遍历扩展态的有效布居转移

Efficient population transfer via non-ergodic extended states in quantum spin glass

Kostyantyn Kechedzhi, Vadim Smelyanskiy, Jarrod R. McClean, Vasil S. Denchev, Masoud Mohseni, Sergei Isakov, Sergio Boixo, Boris Altshuler, Hartmut Neven

摘要:

我们分析了一个新的计算角色的相干多量子比特量子隧穿,产生的频带的非遍历扩展(NEE)的量子态,每个由大量的计算状态(深局部极小的能量景观)具有相似的能量叠加形成。NEE提供了一种在计算态之间进行布居转移(PT)的机制,因此可以作为一种新的量子子程序用于量子搜索、量子并行回火和反向退火优化算法。我们研究了在一个横向场作用下的n自旋量子系统中的PT,其中能量函数$E(z)$在自旋组态$z$的集合上编码一个经典的优化问题。给定具有低能量的初始自旋配置,PT协议在初始自旋配置周围的窄窗口内搜索能量处的其他位串。我们提供了一个分析解决方案PT在一个简单的但不平凡的模型:$M$随机选择的标记位串被分配能量$E(z)$内的一个狭窄的带$[-n -W/2, n + W/2]$,而其余的状态被分配能量0。我们发现,一个典型的PT运行时间与n和L的缩放是相同的,在多目标Grover的量子搜索算法,除了一个因子是等于$\exp(n /(2B^2))$有限的横向领域$B\gg1$。与迄今为止已知的模拟量子非结构化搜索算法中使用的哈密顿算子不同,我们考虑的模型是不可积的,并且人口转移对驱动哈密顿算子的权重在n中不是指数敏感的。我们数值研究PT子程序的一部分,量子并行回火算法的一些例子的二进制优化问题的全连通图。

英文摘要:

We analyze a new computational role of coherent multi-qubit quantum tunneling that gives rise to bands of non-ergodic extended (NEE) quantum states each formed by a superposition of a large number of computational states (deep local minima of the energy landscape) with similar energies. NEE provide a mechanism for population transfer (PT) between computational states and therefore can serve as a new quantum subroutine for quantum search, quantum parallel tempering and reverse annealing optimization algorithms. We study PT in a quantum n-spin system subject to a transverse field where the energy function $E(z)$ encodes a classical optimization problem over the set of spin configurations $z$. Given an initial spin configuration with low energy, PT protocol searches for other bitstrings at energies within a narrow window around the initial one. We provide an analytical solution for PT in a simple yet nontrivial model: $M$ randomly chosen marked bit-strings are assigned energies $E(z)$ within a narrow strip $[-n -W/2, n + W/2]$, while the rest of the states are assigned energy 0. We find that the scaling of a typical PT runtime with n and L is the same as that in the multi-target Grover's quantum search algorithm, except for a factor that is equal to $\exp(n /(2B^2))$ for finite transverse field $B\gg1$. Unlike the Hamiltonians used in analog quantum unstructured search algorithms known so far, the model we consider is non-integrable and population transfer is not exponentially sensitive in n to the weight of the driver Hamiltonian. We study numerically the PT subroutine as a part of quantum parallel tempering algorithm for a number of examples of binary optimization problems on fully connected graphs.

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

↑