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

二维量子哈密顿量的最优乘积态近似

An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms

Sandia National Laboratories(桑迪亚国家实验室)

Ojas Parekh, Kevin Thompson

AI总结:

本文提出一种经典1/2近似算法,用于解决量子最大割问题,证明其最优性,并引入新的纠缠不等式,扩展至Max 2-Local哈密顿量问题。

摘要:

我们解决了使用乘积态近似量子最大割(QMC)问题的最大能量可近似性。已知QMC有一个经典的0.498近似算法,类似于经典最大割的0.878近似。对于最大割,改进0.878近似是唯一游戏难题(UG-hard),而可能预期改进0.498近似对于QMC也是UG-hard。相反,我们给出了QMC的一个经典1/2近似,该结果无条件最优,因为简单的例子显示最优乘积态与一般量子态能量之间存在1/2的差距。我们的结果依赖于从量子Lasserre层次结构第二级推导出的新非线性纠缠不等式。该不等式也适用于量子海森堡模型,我们的结果推广到每个项为正且无1局部部分的Max 2-Local哈密顿量实例。最后,我们进一步证明乘积态对于2-Local哈密顿量的近似是必要的。

英文摘要:

We resolve the approximability of the maximum energy of the Quantum Max Cut (QMC) problem using product states. A classical 0.498-approximation, using a basic semidefinite programming relaxation, is known for QMC, paralleling the celebrated 0.878-approximation for classical Max Cut. For Max Cut, improving the 0.878-approximation is Unique-Games-hard (UG-hard), and one might expect that improving the 0.498-approximation is UG-hard for QMC. In contrast, we give a classical 1/2-approximation for QMC that is unconditionally optimal, since simple examples exhibit a gap of 1/2 between the energies of an optimal product state and general quantum state. Our result relies on a new nonlinear monogamy of entanglement inequality on a triangle that is derived from the second level of the quantum Lasserre hierarchy. This inequality also applies to the quantum Heisenberg model, and our results generalize to instances of Max 2-Local Hamiltonian where each term is positive and has no 1-local parts. Finally, we give further evidence that product states are essential for approximations of 2-Local Hamiltonian.

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

↑