Algorithm for evaluating distance-based entanglement measures

TL;DR

This paper introduces an efficient algorithm based on Gilbert's convex optimization method to evaluate distance-based entanglement measures, providing reliable upper bounds for complex quantum states.

Contribution

The work presents a novel algorithm that efficiently computes upper bounds on entanglement measures, improving accuracy and speed over previous methods.

Findings

Successfully applied to various quantum states including GHZ, W, Horodecki, and chessboard states.

Provides reliable upper bounds for squared Bures metric and relative entropy of entanglement.

Demonstrates versatility and effectiveness in quantifying entanglement.

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.