Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1512.05987 · Physical Review A

Upper bound for SL-invariant entanglement measures of mixed states

Andreas Osterloh

Published May 18, 2016• 6 citations
arXivHTMLPDF

Abstract

An algorithm is proposed that serves to handle full-rank density matrices when coming from a lower-rank method to compute the convex roof. This is in order to calculate an upper bound for any polynomial SL-invariant multipartite entanglement measure $E$. This study exemplifies how this algorithm works based on a method for calculating convex roofs of rank-2 density matrices. It iteratively considers the decompositions of the density matrix into two states each, exploiting the knowledge for the rank-2 case. The algorithm is therefore quasiexact as far as the rank-2 case is concerned, and it also hints where it should include more states in the decomposition of the density matrix. Focusing on the measure of three-way entanglement of qubits (called three-tangle), I show the results the algorithm gives for two states, one of which is the Greenberger-Horne-Zeilinger--Werner (GHZ-$W$) state, for which the exact convex roof is known. It overestimates the three-tangle in the state, thereby giving insight into the optimal decomposition the GHZ-$W$ state has. As a proof of principle, I have run the algorithm for the three-tangle on the transverse quantum Ising model. I give qualitative and quantitative arguments why the convex roof should be close to the upper bound found here.

DOI
10.1103/physreva.93.052322

Related papers

Estimating multipartite entanglement measures

Andreas Osterloh, Philipp Hyllus

We investigate the lower bound obtained from experimental data of a quantum state $\ensuremath{\rho}$, as proposed independently by O. G\"uhne et al. [Phys. Rev. Lett. 98, 110502 (2007)] and J. Eisert et al. [New J. Phys. 9, 46 (2007)], and apply it to mixed states of three qubits. The measure we consider is the convex-roof extended three-tangle. Our findings highlight an intimate relation to lower bounds obtained recently from so-called characteristic curves of a given entanglement measure. We apply the bounds to estimate the three-tangle present in recently performed experiments aimed at producing a three-qubit Greenberger-Horne-Zeilinger (GHZ) state. A nonvanishing lower bound is obtained if the GHZ fidelity of the produced states is larger than $3/4$.

arXiv:0908.3467•Physical Review A•Feb 9, 2010•19 citations

Exact zeros of entanglement for arbitrary rank-two mixtures derived from a geometric view of the zero polytope

Andreas Osterloh

Here I present a method for how intersections of a certain density matrix of rank 2 with the zero polytope can be calculated exactly. This is a purely geometrical procedure which thereby is applicable to obtaining the zeros of SL- and SU-invariant entanglement measures of arbitrary polynomial degree. I explain this method in detail for a recently unsolved problem. In particular, I show how a three-dimensional view, namely, in terms of the Bloch-sphere analogy, solves this problem immediately. To this end, I determine the zero polytope of the three-tangle, which is an exact result up to computer accuracy, and calculate upper bounds to its convex roof which are below the linearized upper bound. The zeros of the three-tangle (in this case) induced by the zero polytope (zero simplex) are exact values. I apply this procedure to a superposition of the four-qubit Greenberger-Horne-Zeilinger and $W$ state. It can, however, be applied to every case one has under consideration, including an arbitrary polynomial convex-roof measure of entanglement and for arbitrary local dimension.

arXiv:1609.08537•Physical Review A•Dec 23, 2016•5 citations

Entanglement Quantification Made Easy: Polynomial Measures Invariant under Convex Decomposition

Bartosz Regula, Gerardo Adesso

Quantifying entanglement in composite systems is a fundamental challenge, yet exact results are available in only a few special cases. This is because hard optimization problems are routinely involved, such as finding the convex decomposition of a mixed state with the minimal average pure-state entanglement, the so-called convex roof. We show that under certain conditions such a problem becomes trivial. Precisely, we prove by a geometric argument that polynomial entanglement measures of degree 2 are independent of the choice of pure-state decomposition of a mixed state, when the latter has only one pure unentangled state in its range. This allows for the analytical evaluation of convex roof extended entanglement measures in classes of rank-2 states obeying such a condition. We give explicit examples for the square root of the three-tangle in three-qubit states, and we show that several representative classes of four-qubit pure states have marginals that enjoy this property.

arXiv:1512.03326•Physical Review Letters•Feb 19, 2016•25 citations

Tangles of superpositions and the convex-roof extension

Andreas Osterloh, Jens Siewert, Armin Uhlmann

We discuss aspects of the convex-roof extension of multipartite entanglement measures, that is, $\mathrm{SL}(2,\mathbb{C})$ invariant tangles. We highlight two key concepts that contain valuable information about the tangle of a density matrix: the zero polytope is a convex set of density matrices with vanishing tangle whereas the convex characteristic curve readily provides a nontrivial lower bound for the convex roof and serves as a tool for constructing the convex roof outside the zero polytope. Both concepts are derived from the tangle for superpositions of the eigenstates of the density matrix. We illustrate their application by considering examples of density matrices for two-qubit and three-qubit states of rank 2, thereby pointing out both the power and the limitations of the concepts.

arXiv:0710.5909•Physical Review A•Mar 6, 2008•61 citations

Three-tangle of the nine classes of four-qubit states

Andreas Osterloh

I calculate the mixed three-tangle ${\ensuremath{\tau}}_{3}[\ensuremath{\rho}]$ for the reduced density matrices of the four-qubit representant states found in Phys. Rev. A 65, 052112 (2002). In most of the cases, the convex roof is obtained, except for one class, where I provide with an upper bound, which is assumed to be very close to the convex roof. I compare with results published in Phys. Rev. Lett. 113, 110501 (2014). Since the method applied there usually results in higher values for the upper bound, in certain cases it can be understood that the convex roof is obtained exactly, namely, when the zero-polytope where ${\ensuremath{\tau}}_{3}$ vanishes shrinks to a single point.

arXiv:1512.02468•Physical Review A•Jul 15, 2016•7 citations

Bounding polynomial entanglement measures for mixed states

Samuel G. Rodriques, Nilanjana Datta, Peter J. Love

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 $\ensuremath{\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) nonzero $E$. We show that the BEA is not, in general, the optimal $S$ decomposition from the point of view of bounding the entanglement of $\ensuremath{\rho}$ and describe an algorithm to construct the entanglement-minimizing $S$ decomposition for $\ensuremath{\rho}$ and place an upper bound on $E(\ensuremath{\rho})$. When applied to the three-tangle, the cost of the algorithm is linear in the rank $d$ of the density matrix and has an accuracy comparable to a steepest-descent algorithm whose cost scales as ${d}^{8}logd$. We compare the upper bound to a lower-bound algorithm given by C. Eltschka and J. Siewert [Phys. Rev. Lett. 108, 020502 (2012)] for the three-tangle and find that on random rank-2 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.

arXiv:1307.2323•Physical Review A•Jul 30, 2014•21 citations
An algorithm is proposed that serves to handle full-rank density matrices when coming from a lower-rank method to compute the convex roof. This is in order to calculate an upper bound for any polynomial SL-invariant multipartite entanglement measure EEE. This study exemplifies how this algorithm works based on a method for calculating convex roofs of rank-2 density matrices. It iteratively considers the decompositions of the density matrix into two states each, exploiting the knowledge for the rank-2 case. The algorithm is therefore quasiexact as far as the rank-2 case is concerned, and it also hints where it should include more states in the decomposition of the density matrix. Focusing on the measure of three-way entanglement of qubits (called three-tangle), I show the results the algorithm gives for two states, one of which is the Greenberger-Horne-Zeilinger--Werner (GHZ-WWW) state, for which the exact convex roof is known. It overestimates the three-tangle in the state, thereby giving insight into the optimal decomposition the GHZ-WWW state has. As a proof of principle, I have run the algorithm for the three-tangle on the transverse quantum Ising model. I give qualitative and quantitative arguments why the convex roof should be close to the upper bound found here.
We investigate the lower bound obtained from experimental data of a quantum state $\ensuremath{\rho}$, as proposed independently by O. G\"uhne et al. [Phys. Rev. Lett. 98, 110502 (2007)] and J. Eisert et al. [New J. Phys. 9, 46 (2007)], and apply it to mixed states of three qubits. The measure we consider is the convex-roof extended three-tangle. Our findings highlight an intimate relation to lower bounds obtained recently from so-called characteristic curves of a given entanglement measure. We apply the bounds to estimate the three-tangle present in recently performed experiments aimed at producing a three-qubit Greenberger-Horne-Zeilinger (GHZ) state. A nonvanishing lower bound is obtained if the GHZ fidelity of the produced states is larger than 3/43/43/4.
Here I present a method for how intersections of a certain density matrix of rank 2 with the zero polytope can be calculated exactly. This is a purely geometrical procedure which thereby is applicable to obtaining the zeros of SL- and SU-invariant entanglement measures of arbitrary polynomial degree. I explain this method in detail for a recently unsolved problem. In particular, I show how a three-dimensional view, namely, in terms of the Bloch-sphere analogy, solves this problem immediately. To this end, I determine the zero polytope of the three-tangle, which is an exact result up to computer accuracy, and calculate upper bounds to its convex roof which are below the linearized upper bound. The zeros of the three-tangle (in this case) induced by the zero polytope (zero simplex) are exact values. I apply this procedure to a superposition of the four-qubit Greenberger-Horne-Zeilinger and WWW state. It can, however, be applied to every case one has under consideration, including an arbitrary polynomial convex-roof measure of entanglement and for arbitrary local dimension.
Quantifying entanglement in composite systems is a fundamental challenge, yet exact results are available in only a few special cases. This is because hard optimization problems are routinely involved, such as finding the convex decomposition of a mixed state with the minimal average pure-state entanglement, the so-called convex roof. We show that under certain conditions such a problem becomes trivial. Precisely, we prove by a geometric argument that polynomial entanglement measures of degree 2 are independent of the choice of pure-state decomposition of a mixed state, when the latter has only one pure unentangled state in its range. This allows for the analytical evaluation of convex roof extended entanglement measures in classes of rank-2 states obeying such a condition. We give explicit examples for the square root of the three-tangle in three-qubit states, and we show that several representative classes of four-qubit pure states have marginals that enjoy this property.
We discuss aspects of the convex-roof extension of multipartite entanglement measures, that is, SL(2,C)\mathrm{SL}(2,\mathbb{C})SL(2,C) invariant tangles. We highlight two key concepts that contain valuable information about the tangle of a density matrix: the zero polytope is a convex set of density matrices with vanishing tangle whereas the convex characteristic curve readily provides a nontrivial lower bound for the convex roof and serves as a tool for constructing the convex roof outside the zero polytope. Both concepts are derived from the tangle for superpositions of the eigenstates of the density matrix. We illustrate their application by considering examples of density matrices for two-qubit and three-qubit states of rank 2, thereby pointing out both the power and the limitations of the concepts.
I calculate the mixed three-tangle ${\ensuremath{\tau}}_{3}[\ensuremath{\rho}]$ for the reduced density matrices of the four-qubit representant states found in Phys. Rev. A 65, 052112 (2002). In most of the cases, the convex roof is obtained, except for one class, where I provide with an upper bound, which is assumed to be very close to the convex roof. I compare with results published in Phys. Rev. Lett. 113, 110501 (2014). Since the method applied there usually results in higher values for the upper bound, in certain cases it can be understood that the convex roof is obtained exactly, namely, when the zero-polytope where ${\ensuremath{\tau}}_{3}$ vanishes shrinks to a single point.
We generalize the notion of the best separable approximation (BSA) and best WWW-class approximation (BWA) to arbitrary pure-state entanglement measures, defining the best zero-EEE approximation (BEA). We show that for any polynomial entanglement measure EEE, any mixed state $\ensuremath{\rho}$ admits at least one ``SSS decomposition,'' i.e., a decomposition in terms of a mixed state on which EEE is equal to zero, and a single additional pure state with (possibly) nonzero EEE. We show that the BEA is not, in general, the optimal SSS decomposition from the point of view of bounding the entanglement of $\ensuremath{\rho}$ and describe an algorithm to construct the entanglement-minimizing SSS decomposition for $\ensuremath{\rho}$ and place an upper bound on $E(\ensuremath{\rho})$. When applied to the three-tangle, the cost of the algorithm is linear in the rank ddd of the density matrix and has an accuracy comparable to a steepest-descent algorithm whose cost scales as d8logd{d}^{8}logdd8logd. We compare the upper bound to a lower-bound algorithm given by C. Eltschka and J. Siewert [Phys. Rev. Lett. 108, 020502 (2012)] for the three-tangle and find that on random rank-2 three-qubit density matrices, the difference between the upper and lower bounds is 0.140.140.14 on average. We also find that the three-tangle of random full-rank three-qubit density matrices is less than 0.0230.0230.023 on average.