arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.00554quant-phmath-phmath.MP
收藏

基于量子启发的秩约束优化算法

Quantum-Inspired Hierarchy for Rank-Constrained Optimization

Xiao-Dong Yu, Timo Simnacher, H. Chau Nguyen, Otfried Gühne

摘要:

信息论中的许多问题可以归结为矩阵的优化问题,其中矩阵的秩是受约束的。我们建立了秩约束优化和量子纠缠理论之间的联系。更准确地说,我们证明了一个大类的秩约束半定规划可以写为一个凸优化可分离的量子态,因此,我们构建了一个完整的层次的半定规划解决原来的问题。该层次结构不仅为秩约束优化问题提供了一系列经过验证的边界,而且当考虑层次结构的最低层时,在实践中也给出了相当好的且通常精确的值。我们证明了我们的方法可以用于量子信息处理中的相关问题,如纯态优化,混合酉信道和忠实纠缠的表征,以及量子上下文,以及经典信息论中的最大割问题,伪布尔优化,和图的正交表示。最后,我们表明,我们的想法可以扩展到秩约束二次和高阶规划。

英文摘要:

Many problems in information theory can be reduced to optimizations over matrices, where the rank of the matrices is constrained. We establish a link between rank-constrained optimization and the theory of quantum entanglement. More precisely, we prove that a large class of rank-constrained semidefinite programs can be written as a convex optimization over separable quantum states and, consequently, we construct a complete hierarchy of semidefinite programs for solving the original problem. This hierarchy not only provides a sequence of certified bounds for the rank-constrained optimization problem, but also gives pretty good and often exact values in practice when the lowest level of the hierarchy is considered. We demonstrate that our approach can be used for relevant problems in quantum information processing, such as the optimization over pure states, the characterization of mixed unitary channels and faithful entanglement, and quantum contextuality, as well as in classical information theory including the maximum cut problem, pseudo-Boolean optimization, and the orthonormal representation of graphs. Finally, we show that our ideas can be extended to rank-constrained quadratic and higher-order programming.

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

↑