arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.13818quant-phphysics.comp-ph
收藏

Linear semi-infinite programming approach for entanglement quantification

Thiago Mureebe Carrijo, Wesley Bueno Cardoso, Ardiley Torres Avelar

英文摘要:

We explore the dual problem of the convex roof construction by identifying it as a linear semi-infinite programming (LSIP) problem. Using the LSIP theory, we show the absence of a duality gap between primal and dual problems, even if the entanglement quantifier is not continuous, and prove that the set of optimal solutions is non-empty and bounded. In addition, we implement a central cutting-plane algorithm for LSIP to quantify entanglement between three qubits. The algorithm has global convergence property and gives lower bounds on the entanglement measure for non-optimal feasible points. As an application, we use the algorithm for calculating the convex roof of the three-tangle and $π$-tangle measures for families of states with low and high ranks. As the $π$-tangle measure quantifies the entanglement of W states, we apply the values of the two quantifiers to distinguish between the two different types of genuine three-qubit entanglement.

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

↑