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

量子算法求解随机超图 MAX-3-XORSAT 问题的可近似性

On the approximability of random-hypergraph MAX-3-XORSAT problems with quantum algorithms

Eliot Kapit, Brandon A. Barton, Sean Feeney, George Grattan, Pratik Patnaik, Jacob Sagal, Lincoln D. Carr, Vadim Oganesyan

AI总结:

本文研究随机超图 MAX-3-XORSAT 的量子可近似性,提出谱滤波量子优化算法,并证明其在近似困难区间可于次二次时间获得有保证的近似解。

摘要:

NP 中约束满足问题的一个典型特征是近似困难性:在最坏情况下,对所有已知方法而言,找到质量足够高的近似解都具有指数级难度。从根本上说,由于不存在任何有引导的逃离局部极小值的方法,经典情形下的精确与近似困难性都得以保证,但量子算法对应的机制仍知之甚少。对于基于哈密顿量时间演化的算法,我们通过典型困难的 MAX-3-XORSAT 问题类别探讨这一问题。我们得出结论:量子精确困难性与近似困难性的机制存在根本区别。我们回顾文献中的已知结果,并识别出使传统量子方法(例如绝热量子计算)在最坏情况下成为薄弱近似算法的机制。我们构造了一族能够规避这些问题的谱滤波量子算法,并发展了关于其性能的解析理论。我们表明,对于处于近似困难区间的随机超图,如果将能量定义为 $E=N_{\mathrm{unsat}}-N_{\mathrm{sat}}$,谱滤波量子优化将在次二次时间内返回满足 $E\leq q_m E_{\mathrm{GS}}$(其中 $E_{\rm GS}$ 为基态能量)的状态;保守地说,$q_m\simeq0.59$。相比之下,对于经典搜索所面对的最困难实例,$q_m\to0$。我们通过大量数值模拟检验了所有这些论断。我们并不声称该近似保证对所有可能的超图都成立,尽管该算法的机制很可能具有广泛的推广性。这些结果表明,量子计算机在近似优化方面比此前所认为的更加强大。

英文摘要:

A canonical feature of the constraint satisfaction problems in NP is approximation hardness, where in the worst case, finding sufficient-quality approximate solutions is exponentially hard for all known methods. Fundamentally, the lack of any guided local minimum escape method ensures both exact and approximate classical approximation hardness, but the equivalent mechanism(s) for quantum algorithms are poorly understood. For algorithms based on Hamiltonian time evolution, we explore this question through the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We review known results from the literature, and identify mechanisms that make conventional quantum methods (such as Adiabatic Quantum Computing) weak approximation algorithms in the worst case. We construct a family of spectrally filtered quantum algorithms that escape these issues, and develop analytical theories for their performance. We show that, for random hypergraphs in the approximation-hard regime, if we define the energy to be $E = N_{\mathrm{unsat}}-N_{\mathrm{sat}}$, spectrally filtered quantum optimization will return states with $E \leq q_m E_{\mathrm{GS}}$ (where $E_{\rm GS}$ is the ground state energy) in sub-quadratic time, where conservatively, $q_m \simeq 0.59$. This is in contrast to $q_m \to 0$ for the hardest instances with classical searches. We test all of these claims with extensive numerical simulations. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

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

↑