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

用于有符号最大割问题的奇偶校验QAOA性能

Performance of Parity QAOA for the Signed Max-Cut Problem

Anita Weidinger, Glen Bigan Mbeng, Michael Fellner, Davit Khachatryan, Wolfgang Lechner

AI总结:

本文研究Parity架构下QAOA求解有符号Max-Cut问题的性能,证明其在固定电路深度下优于基于SWAP网络的传统QAOA,并利用Clifford电路估计大规模问题的性能下界。

摘要:

在嘈杂中型量子设备上实际实现量子优化算法需要考虑其有限的连通性。为此,Parity架构被引入,通过将二进制优化问题编码到平面量子芯片上来克服这一限制。我们研究了量子近似优化算法在Parity架构上的性能(Parity QAOA),用于求解完全图和正则图上的有符号Max-Cut问题实例。通过在固定电路深度下比较算法,我们证明Parity QAOA优于基于SWAP网络的传统QAOA实现。我们的分析利用Clifford电路来估计Parity QAOA在经典计算机上原本无法处理的问题规模下的性能下界。对于单层电路,我们还对两种算法的递归变体进行了基准测试,表明它们的性能相同。

英文摘要:

The practical implementation of quantum optimization algorithms on noisy intermediate-scale quantum devices requires accounting for their limited connectivity. As such, the Parity architecture was introduced to overcome this limitation by encoding binary optimization problems onto planar quantum chips. We investigate the performance of the Quantum Approximate Optimization Algorithm on the Parity architecture (Parity QAOA) for solving instances of the signed Max-Cut problem on complete and regular graphs. By comparing the algorithms at fixed circuit depth, we demonstrate that Parity QAOA outperforms conventional QAOA implementations based on SWAP networks. Our analysis utilizes Clifford circuits to estimate lower performance bounds for Parity QAOA for problem sizes that would be otherwise inaccessible on classical computers. For single layer circuits we additionally benchmark the recursive variant of the two algorithms, showing that their performance is equal.

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

↑