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

量子最大割问题的改进近似算法

An Improved Approximation Algorithm for Quantum Max-Cut

Robbie King

AI总结:

提出改进的量子最大割近似算法,通过SDP舍入到纠缠态并选择变分电路参数,在三角形自由图上达到0.582近似比,优于先前0.531和0.533的结果,并对EPR哈密顿量给出1/√2近似算法。

摘要:

我们提出了一种用于量子最大割问题的近似算法,该算法通过对SDP松弛进行舍入来得到一个纠缠量子态。SDP被用于选择变分量子电路的参数。随后,纠缠态被表示为该量子电路作用于一个乘积态的结果。该算法在三角形自由图上达到了0.582的近似比。此前Anshu、Gosset、Morenz以及Parekh、Thompson的最佳算法分别达到了0.531和0.533的近似比。此外,我们研究了EPR哈密顿量,我们认为这是一个自然的中间问题,它隔离了局部哈密顿量问题的一些关键量子特征。对于EPR哈密顿量,我们给出了一个在所有图上近似比为$1 / \sqrt{2}$的近似算法。

英文摘要:

We give an approximation algorithm for Quantum Max-Cut which works by rounding an SDP relaxation to an entangled quantum state. The SDP is used to choose the parameters of a variational quantum circuit. The entangled state is then represented as the quantum circuit applied to a product state. It achieves an approximation ratio of 0.582 on triangle-free graphs. The previous best algorithms of Anshu, Gosset, Morenz, and Parekh, Thompson achieved approximation ratios of 0.531 and 0.533 respectively. In addition, we study the EPR Hamiltonian, which we argue is a natural intermediate problem which isolates some key quantum features of local Hamiltonian problems. For the EPR Hamiltonian, we give an approximation algorithm with approximation ratio $1 / \sqrt{2}$ on all graphs.

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

↑