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

改进量子优化以实现二次时间复杂度

Improving Quantum Optimization to Achieve Quadratic Time Complexity

Ji Jiang, Peisheng Huang, Zhiyi Wu, Xuandong Sun, Zechen Guo, Wenhui Huang, Libo Zhang, Yuxuan Zhou, Jiawei Zhang, Weijie Guo, Xiayu Linpeng, Song Liu, Wenhui R… 展开作者

Ji Jiang, Peisheng Huang, Zhiyi Wu, Xuandong Sun, Zechen Guo, Wenhui Huang, Libo Zhang, Yuxuan Zhou, Jiawei Zhang, Weijie Guo, Xiayu Linpeng, Song Liu, Wenhui Ren, Ziyu Tao, Ji Chu, Jingjing Niu, Youpeng Zhong, Dapeng Yu

AI总结:

针对QAOA参数选择难题,提出Penta-O逐层参数设置策略,消除经典外层循环,实现p层QAOA的二次时间复杂度和最小采样开销,实验验证其近最优性能。

摘要:

量子近似优化算法(QAOA)是组合优化中实现量子优势的有前景的候选方案。然而,其变分框架在电路参数选择方面长期存在挑战。在本工作中,我们证明了QAOA产生的能量期望可以表示为最终层混合器参数的三角函数。利用这一见解,我们引入了Penta-O,一种逐层参数设置策略,它消除了经典外层循环,保持最小的采样开销,并确保性能非递减。该方法广泛适用于以伊辛模型形式表达的通用二次无约束二元优化。对于p层QAOA,Penta-O实现了前所未有的二次时间复杂度$\mathcal{O}(p^2)$,采样开销与$5p+1$成正比。通过实验和模拟,我们证明了由Penta-O增强的QAOA以卓越的电路深度效率实现了接近最优的性能。我们的工作为推进变分量子算法提供了通用工具。

英文摘要:

Quantum Approximate Optimization Algorithm (QAOA) is a promising candidate for achieving quantum advantage in combinatorial optimization. However, its variational framework presents a long-standing challenge in selecting circuit parameters. In this work, we prove that the energy expectation produced by QAOA can be expressed as a trigonometric function of the final-level mixer parameter. Leveraging this insight, we introduce Penta-O, a level-wise parameter-setting strategy that eliminates the classical outer loop, maintains minimal sampling overhead, and ensures non-decreasing performance. This method is broadly applicable to the generic quadratic unconstrained binary optimization formulated as the Ising model. For a $p$-level QAOA, Penta-O achieves an unprecedented quadratic time complexity of $\mathcal{O}(p^2)$ and a sampling overhead proportional to $5p+1$. Through experiments and simulations, we demonstrate that QAOA enhanced by Penta-O achieves near-optimal performance with exceptional circuit depth efficiency. Our work provides a versatile tool for advancing variational quantum algorithms.

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

↑