arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.07211quant-ph
收藏

等变 QAOA 与混合器之争

Equivariant QAOA and the Duel of the Mixers

Boris Tsvelikhovskiy, Ilya Safro, Yuri Alexeev

AI总结:

本文针对 QAOA 混合器设计,提出与对称群 $S_d$ 等变的定制混合器 $H_M$,并在边着色和图划分实验中证明其优于传统 $B$。

摘要:

为量子近似优化算法(Quantum Approximate Optimization Algorithm,QAOA)哈密顿量构造最优混合器,对于提升 QAOA 求解组合优化问题的性能至关重要。我们提出了一种构造 QAOA 定制混合器哈密顿量的系统方法,确保其与经典优化问题目标函数的内在对称性保持一致。该方法的关键是识别一个算子:它与对称群在 QAOA 底层希尔伯特空间上的作用对易,并满足有效混合器哈密顿量功能所必需的技术标准。我们给出了一种专门针对对称群 $S_d$ 的构造方法,该群广泛存在于多种组合优化问题中。通过严格验证所需性质、给出具体公式以及相应的可实现量子线路,我们确立了所提出混合器哈密顿量的可行性。此外,我们证明经典混合器 $B$ 仅与 $S_d$ 的一个子群对易,而该子群的阶显著小于群本身的阶,从而提升了所提方法的效率。为评估方法有效性,我们在多种图上的边着色和图划分问题中,比较了使用不同混合器哈密顿量的两个 QAOA 变体:传统的 $B=\sum X_i$ 与新提出的 $H_M$。我们观察到均值存在统计显著差异,并且在多次独立模拟中,新变体始终表现出更优性能。此外,我们分析了其他热启动 QAOA 变体性能不佳的现象,并结合近期文献结果给出了概念性解释。

英文摘要:

Constructing an optimal mixer for Quantum Approximate Optimization Algorithm (QAOA) Hamiltonian is crucial for enhancing the performance of QAOA in solving combinatorial optimization problems. We present a systematic methodology for constructing the QAOA tailored mixer Hamiltonian, ensuring alignment with the inherent symmetries of classical optimization problem objectives. The key to our approach is to identify an operator that commutes with the action of the group of symmetries on the QAOA underlying Hilbert space and meets the essential technical criteria for effective mixer Hamiltonian functionality. We offer a construction method specifically tailored to the symmetric group $S_d$, prevalent in a variety of combinatorial optimization problems. By rigorously validating the required properties, providing a concrete formula and corresponding quantum circuit for implementation, we establish the viability of the proposed mixer Hamiltonian. Furthermore, we demonstrate that the classical mixer $B$ commutes only with a subgroup of $S_d$ of significantly smaller order than the group itself, enhancing the efficiency of the proposed approach. To evaluate the effectiveness of our methodology, we compare two QAOA variants utilizing different mixer Hamiltonians: conventional $B=\sum X_i$ and the newly proposed $H_M$ in edge coloring and graph partitioning problems across various graphs. We observe statistically significant differences in mean values, with the new variant consistently demonstrating superior performance across multiple independent simulations. Additionally, we analyze the phenomenon of poor performance in alternative warm-start QAOA variants, providing a conceptual explanation supported by recent literature findings.

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

↑