Bounding Polynomial Entanglement Measures for Mixed States

Abstract

We generalize the notion of the best separable approximation (BSA) and best W-class approximation (BWA) to arbitrary pure state entanglement measures, defining the best zero-$E$ approximation (BEA). We show that for any polynomial entanglement measure $E$, any mixed state $\rho$ admits at least one "$S$-decomposition," i.e., a decomposition in terms of a mixed state on which $E$ is equal to zero, and a single additional pure state with (possibly) non-zero $E$. We show that the BEA is not in general the optimal $S$-decomposition from the point of view of bounding the entanglement of $\rho$, and describe an algorithm to construct the entanglement-minimizing $S$-decomposition for $\rho$ and place an upper bound on $E(\rho )$. When applied to the three-tangle, the cost of the algorithm is linear in the rank $d$ of the density matrix and has accuracy comparable to a steepest descent algorithm whose cost scales as $d^8\log d$. We compare the upper bound to a lower bound algorithm given by Eltschka and Siewert for the three-tangle, and find that on random rank-two three-qubit density matrices, the difference between the upper and lower bounds is $0.14$ on average. We also find that the three-tangle of random full-rank three qubit density matrices is less than $0.023$ on average.

Generalized results in previous version to polynomial entanglement monotones beyond the three-tangle

References in corpus (5)

• Quantum computing with trapped ions
• Entangled three-qubit states without concurrence and three-tangle
• Entanglement of three-qubit Greenberger-Horne-Zeilinger-symmetric states
• Three-tangle for mixtures of generalized GHZ and generalized W states
• Three-Tangle for Rank-3 Mixed States: mixture of Greenberger-Horne-Zeilinger, W and flipped W states

Cited by in corpus (17)

• Quantifying entanglement resources
• Multipartite entanglement measures
• Strong monogamy conjecture for multiqubit entanglement: The four-qubit case
• Strong monogamy inequalities for four qubits
• Building separable approximations for quantum states via neural networks
• Entanglement quantification made easy: Polynomial measures invariant under convex decomposition
• Numerical and analytical results for geometric measure of coherence and geometric measure of entanglement
• Evaluation of entanglement measures by a single observable
• Geometric approach to entanglement quantification with polynomial measures
• Triangle inequalities in coherence measures and entanglement concurrence
• The nine ways of four qubit entanglement and their threetangle
• Upper bound for SL-invariant entanglement measures of mixed states
• Exact zeros of entanglement for arbitrary rank-two mixtures: how a geometric view of the zero-polytope makes life more easy
• The Essentially Entangled Component of Multipartite Mixed Quantum States, its Properties and an Efficient Algorithm for its Extraction
• Investigating bound entangled two-qutrit states via the best separable approximation
• Upper bound on three tangles of reduced states of four-qubit pure states
• Remote control of quantum correlations in two-qubit receiver via three-qubit sender