arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.05698quant-phcs.DS
收藏

水平$2$量子Lasserre体系在量子近似算法中的应用

Application of the Level-$2$ Quantum Lasserre Hierarchy in Quantum Approximation Algorithms

Ojas Parekh, Kevin Thompson

摘要:

Lasserre层次是一组半定规划,它对许多NP-难优化问题的最优解产生越来越紧的边界。该层次结构是由级别参数化的,更高的级别对应于更准确的松弛。高级程序已被证明是许多NP难优化问题的近似算法的宝贵组成部分。有一个自然的类似量子层次,它也是参数化的水平,并提供了一个放松的许多(QMA-硬)量子问题的兴趣。然而,与经典的情况相反,只有一个近似算法,它利用更高层次的层次结构。在这里,我们提供了有史以来第一次使用的水平$2$层次结构的近似算法的一个特定的QMA完全的问题,所谓的量子最大切割。我们获得适度的改进,对国家的最先进的近似因子为这个问题,以及表明,水平-$2$层次结构满足许多物理动机的限制,水平-$1$不满足。事实上,这一观察是我们分析的核心,并表明更高层次的量子Lasserre层次可能是非常有用的工具,在QMA完全问题的近似算法的设计。

英文摘要:

The Lasserre Hierarchy is a set of semidefinite programs which yield increasingly tight bounds on optimal solutions to many NP-hard optimization problems. The hierarchy is parameterized by levels, with a higher level corresponding to a more accurate relaxation. High level programs have proven to be invaluable components of approximation algorithms for many NP-hard optimization problems. There is a natural analogous quantum hierarchy, which is also parameterized by level and provides a relaxation of many (QMA-hard) quantum problems of interest. In contrast to the classical case, however, there is only one approximation algorithm which makes use of higher levels of the hierarchy. Here we provide the first ever use of the level-$2$ hierarchy in an approximation algorithm for a particular QMA-complete problem, so-called Quantum Max Cut. We obtain modest improvements on state-of-the-art approximation factors for this problem, as well as demonstrate that the level-$2$ hierarchy satisfies many physically-motivated constraints that the level-$1$ does not satisfy. Indeed, this observation is at the heart of our analysis and indicates that higher levels of the quantum Lasserre Hierarchy may be very useful tools in the design of approximation algorithms for QMA-complete problems.

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

↑