arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2105.00537cond-mat.dis-nncond-mat.stat-mechquant-ph
收藏

Ising自旋玻璃基态的D波近似算法与经典近似算法的比较及启发式计算

A comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass

Ran Yaacoby, Nathan Schaar, Leon Kellerhals, Oren Raz, Danny Hermelin, Rami Pugatch

摘要:

在一般图上寻找伊辛-自旋玻璃的基态属于NP难问题,普遍认为没有有效的多项式时间算法来解决它们。在计算机科学中开发的用于处理此类问题的方法是设计在多项式时间内运行的近似算法,并提供解决方案,其质量在最佳未知解方面具有可证明的保证。最近,几个算法的伊辛-自旋玻璃问题的图,提供不同的近似保证,虽然没有实施。同样在最近,D-wave公司构建了绝热量子计算机的物理实现,并使研究人员能够访问它。D-wave特别适合于计算伊辛自旋玻璃在其嵌合体图(一种有界度的图)上的基态的近似。在这项工作中,我们比较了最近开发的近似算法的性能,解决了伊辛自旋玻璃问题的图形上的有界度对D-波计算机。我们还比较了一个启发式专门处理固定的D波嵌合体图。D波计算机能够找到更好的近似我们研究的所有随机实例。此外,D波的收敛时间也明显更好。这些结果表明了D波计算机在某些特定情况下的优点。更广泛地说,我们的方法是相关的其他性能比较研究。我们认为,重要的是要比较量子计算机的性能,不仅对精确的经典算法与指数运行时缩放,而且近似算法与多项式运行时缩放和可证明的性能保证。

英文摘要:

Finding the ground state of an Ising-spin glass on general graphs belongs to the class of NP-hard problems, widely believed to have no efficient polynomial-time algorithms for solving them. An approach developed in computer science for dealing with such problems is to devise approximation algorithms that run in polynomial time, and provide solutions with provable guarantees on their quality in terms of the optimal unknown solution. Recently, several algorithms for the Ising-spin glass problem on a graph that provide different approximation guarantees were introduced albeit without implementation. Also recently, D-wave company constructed a physical realization of an adiabatic quantum computer, and enabled researchers to access it. D-wave is particularly suited for computing an approximation for the ground state of an Ising spin glass on its chimera graph -- a graph with bounded degree. In this work, we compare the performance of a recently developed approximation algorithm for solving the Ising spin glass problem on graphs of bounded degree against the D-wave computer. We also compared a heuristic tailored specifically to handle the fixed D-wave chimera graph. D-wave computer was able to find better approximations to all the random instances we studied. Furthermore the convergence times of D-wave were also significantly better. These results indicate the merit of D-wave computer under certain specific instances. More broadly, our method is relevant to other performance comparison studies. We suggest that it is important to compare the performance of quantum computers not only against exact classical algorithms with exponential run-time scaling, but also to approximation algorithms with polynomial run-time scaling and a provable guarantee on performance.

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

↑