Algorithm for evaluating distance-based entanglement measures

Abstract

Quantifying entanglement in quantum systems is an important yet challenging task due to its NP-hard nature. In this work, we propose an efficient algorithm for evaluating distance-based entanglement measures. Our approach builds on Gilbert's algorithm for convex optimization, providing a reliable upper bound on the entanglement of a given arbitrary state. We demonstrate the effectiveness of our algorithm by applying it to various examples, such as calculating the squared Bures metric of entanglement as well as the relative entropy of entanglement for GHZ states, $W$ states, Horodecki states, and chessboard states. These results demonstrate that our algorithm is a versatile and accurate tool that can quickly provide reliable upper bounds for entanglement measures.

7 pages, 4 figures; close to the published version

References in corpus (7)

• Entanglement Theory and the Second Law of Thermodynamics
• Entanglement criteria based on local uncertainty relations are strictly stronger than the computable cross norm criterion
• Estimating entanglement monotones with a generalization of the Wootters formula
• Algorithm for characterizing stochastic local operations and classical communication classes of multiparticle entanglement
• Convex separation from convex optimization for large-scale problems
• Distance between Bound Entangled States from Unextendible Product Bases and Separable States
• Detecting separable states via semidefinite programs