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:0710.5909 · Physical Review A

Tangles of superpositions and the convex-roof extension

Andreas Osterloh, Jens Siewert, Armin Uhlmann

Published Mar 6, 2008• 61 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.77.032310

Related papers

Upper bound for SL-invariant entanglement measures of mixed states

Andreas Osterloh

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.

arXiv:1512.05987•Physical Review A•May 18, 2016•6 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

Evaluating Convex Roof Entanglement Measures

Géza Tóth, Tobias Moroder, Otfried Gühne

We show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples.

arXiv:1409.3806•Physical Review Letters•Apr 21, 2015•106 citations

On special rank-two mixtures: how the zero-polytope makes life more easy

Andreas Osterloh

In the recent contribution a rather simple example of a rank-two density matrix has posed a problem in calculating upper bounds of the convex roof of the three-tangle from the zero polytope. Here, I show how a three-dimensional view, namely in terms of the Boch-sphere analogy, solves the problem immediately. I therefore calculate the zero-polytope of the three-tangle numerically exactly (up to computer accuracy) and upper bounds to its convex roof. This method can then be applied to the more general case under consideration. Here, I apply this procedure to a superposition of the four qubit GHZ- and W-state.

•Sep 27, 2016•0 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

Efficient evaluation of convex roof entanglement measures

Géza Tóth, Tobias Moroder, Otfried Gühne

We show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples

•Sep 12, 2014•0 citations
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.
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.
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.
We show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples.
In the recent contribution a rather simple example of a rank-two density matrix has posed a problem in calculating upper bounds of the convex roof of the three-tangle from the zero polytope. Here, I show how a three-dimensional view, namely in terms of the Boch-sphere analogy, solves the problem immediately. I therefore calculate the zero-polytope of the three-tangle numerically exactly (up to computer accuracy) and upper bounds to its convex roof. This method can then be applied to the more general case under consideration. Here, I apply this procedure to a superposition of the four qubit GHZ- and W-state.
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 show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples