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.

arXiv comment7 pages, 4 figures; close to the published version

References in corpus (28)

• Quantum entanglement
• Separability Criterion for Density Matrices
• Separability of Mixed States: Necessary and Sufficient Conditions
• Three qubits can be entangled in two inequivalent ways
• Quantifying Entanglement
• Entanglement Measures and Purification Procedures
• Separability criterion and inseparable mixed states with positive partial transposition
• The Role of Relative Entropy in Quantum Information Theory
• Bell Inequalities and the Separability Criterion
• Optimization of entanglement witnesses
• Classification of mixed three-qubit states
• Further results on the cross norm criterion for separability
• Entanglement Theory and the Second Law of Thermodynamics
• Reflections upon separability and distillability
• Approximate transformations and robust manipulation of bipartite pure state entanglement
• Construction of quantum states with bound entanglement
• Entanglement criteria based on local uncertainty relations are strictly stronger than the computable cross norm criterion
• Entanglement Detection by Local Orthogonal Observables
• Separable balls around the maximally mixed multipartite quantum states
• Estimating entanglement monotones with a generalization of the Wootters formula
• Convex optimization over classes of multiparticle entanglement
• A complete criterion for separability detection
• Algorithm for characterizing stochastic local operations and classical communication classes of multiparticle entanglement
• Hilbert-Schmidt distance and entanglement witnessing
• 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
• Relative entropy in quantum information theory