arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.13207quant-ph
收藏

改进的递归QAOA用于双图上的精确最大割解:超越QAOA极限

Modified Recursive QAOA for Exact Max-Cut Solutions on Bipartite Graphs: Closing the Gap Beyond QAOA Limit

Korea Institute for Advanced Study (KIAS)(韩国高等科学研究院);Australian National University(澳大利亚国立大学);Agency for Science, Technology and Research (A*STAR)(科学技术研究局);Kyung Hee University(庆熙大学)

Eunok Bae, Hyukjoon Kwon, V Vijendran, Soojoon Lee

AI总结:

本文提出改进的递归QAOA算法,通过限制参数范围实现双图和一般图的精确最大割解,超越了传统QAOA的性能极限。

摘要:

量子近似优化算法(QAOA)是一种量子-经典混合算法,旨在近似求解如MAX-CUT问题等组合优化问题。它被认为是实现噪声中间尺度量子时代量子优势的潜在候选者,并已被广泛研究。然而,低级QAOA的性能限制在各种实例中也已得到展示。在本工作中,我们首先分析性地证明了在双图上求解MAX-CUT问题时,一级QAOA的性能限制。为此,我们基于双图的平均度数推导出一个近似比的上界。其次,我们证明递归QAOA(RQAOA)通过使用QAOA作为子程序递归减少图的大小,优于一级QAOA。然而,随着图的大小增加,RQAOA的性能也表现出限制。最后,我们显示RQAOA在受限参数范围内可以完全解决这些限制。令人惊讶的是,这种改进的RQAOA总是在任何双图上找到精确的最大割,甚至在具有奇数权重的一般图上也是如此。

英文摘要:

Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm proposed with the goal of approximately solving combinatorial optimization problems such as the MAX-CUT problem. It has been considered a potential candidate for achieving quantum advantage in the Noisy Intermediate-Scale Quantum era and has been extensively studied. However, the performance limitations of low-level QAOA have also been demonstrated across various instances. In this work, we first analytically prove the performance limitations of level-1 QAOA in solving the MAX-CUT problem on bipartite graphs. To this end, we derive an upper bound for the approximation ratio based on the average degree of bipartite graphs. Second, we demonstrate that Recursive QAOA (RQAOA), which recursively reduces graph size using QAOA as a subroutine, outperforms the level-1 QAOA. However, the performance of RQAOA exhibits limitations as the graph size increases. Finally, we show that RQAOA with a restricted parameter regime can fully address these limitations. Surprisingly, this modified RQAOA always finds the exact maximum cut for any bipartite graphs and even for a more general graph with parity-signed weights.

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

↑