arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.04686quant-phcs.DS
收藏

量子绝热优化

Quantum adiabatic optimization without heuristics

Michael Jarret, Brad Lackey, Aike Liu, Kianna Wan

摘要:

量子绝热优化(QAO)使用含时哈密顿量$H(s)$与光谱间隙$γ(s)$。假设存在一个Oracle $Γ$,使得$γ_\min = Θ\left(\min_sΓ(s)\right)$,我们提供了一个算法,可靠地执行QAO的时间$O\left(γ_\min^{-1}\right)$与$O\left(\log(γ_\min^{-1})\right)$ Oracle查询,其中$γ_\min = \min_s γ(s)$。我们的策略不是启发式的,不需要猜测时间参数或退火路径。相反,我们的算法自然地产生一个退火路径,使$\|dH/ds\| \approx γ(s)$,并选择自己的运行时间尽可能接近最佳,同时有希望收敛到基态。然后,我们证明了这种方法在实践中的可行性,通过明确构建一个缺口甲骨文$Γ$的问题,找到最小点$m = \mathrm{argmin}_u W(u)$的成本函数$W:\mathcal{V}\longrightarrow [0,1]$,限制自己的计算基础测量和驱动哈密尔顿$H(0)=I - |\mathcal{V}|^{-1}\sum_{u,v \in \mathcal{V}}\vert{u}\rangle\langle{v}\vert$。仅要求$W$在其频谱间隙上具有恒定的下限并且在其频谱比上具有恒定的上限$κ$,我们的QAO算法以时间上的概率$(1-ε)(1-e^{-1/ε})$返回$m$ $\widetilde{\mathcal{O}}(ε^{-1}[\sqrt{|\mathcal{V}|} + (κ-1)^{2/3}|\mathcal{V}|^{2/3}])$。这实现了所有$κ$的量子优势,并在$κ\approx 1$时恢复Grover缩放到对数因子。我们实现的算法作为一个子程序中的优化过程,产生$m$指数小的故障概率和预期的运行时间$\widetilde{\mathcal{O}}(ε^{-1}[\sqrt{|\mathcal{V}|} + (κ-1)^{2/3}|\mathcal{V}|^{2/3}])$,即使$κ$是事先不知道的。

英文摘要:

Quantum adiabatic optimization (QAO) is performed using a time-dependent Hamiltonian $H(s)$ with spectral gap $γ(s)$. Assuming the existence of an oracle $Γ$ such that $γ_\min = Θ\left(\min_sΓ(s)\right)$, we provide an algorithm that reliably performs QAO in time $O\left(γ_\min^{-1}\right)$ with $O\left(\log(γ_\min^{-1})\right)$ oracle queries, where $γ_\min = \min_s γ(s)$. Our strategy is not heuristic and does not require guessing time parameters or annealing paths. Rather, our algorithm naturally produces an annealing path such that $\|dH/ds\| \approx γ(s)$ and chooses its own runtime to be as close as possible to optimal while promising convergence to the ground state. We then demonstrate the feasibility of this approach in practice by explicitly constructing a gap oracle $Γ$ for the problem of finding the minimum point $m = \mathrm{argmin}_u W(u)$ of the cost function $W:\mathcal{V}\longrightarrow [0,1]$, restricting ourselves to computational basis measurements and driving Hamiltonian $H(0)=I - |\mathcal{V}|^{-1}\sum_{u,v \in \mathcal{V}}\vert{u}\rangle\langle{v}\vert$. Requiring only that $W$ have a constant lower bound on its spectral gap and upper bound $κ$ on its spectral ratio, our QAO algorithm returns $m$ with probability $(1-ε)(1-e^{-1/ε})$ in time $\widetilde{\mathcal{O}}(ε^{-1}[\sqrt{|\mathcal{V}|} + (κ-1)^{2/3}|\mathcal{V}|^{2/3}])$. This achieves a quantum advantage for all $κ$, and recovers Grover scaling up to logarithmic factors when $κ\approx 1$. We implement the algorithm as a subroutine in an optimization procedure that produces $m$ with exponentially small failure probability and expected runtime $\widetilde{\mathcal{O}}(ε^{-1}[\sqrt{|\mathcal{V}|} + (κ-1)^{2/3}|\mathcal{V}|^{2/3}])$ even when $κ$ is not known beforehand.

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

↑