2009
DOI: 10.1103/physreva.79.024306
|View full text |Cite
|
Sign up to set email alerts
|

Three-tangle for rank-three mixed states: Mixture of Greenberger-Horne-Zeilinger,W, and flipped-Wstates

Abstract: Three-tangle for the rank-three mixture composed of Greenberger-Horne-Zeilinger, W and flipped W states is analytically calculated. The optimal decompositions in the full range of parameter space are constructed by making use of the convex-roof extension. We also provide an analytical technique, which determines whether or not an arbitrary rank-3 state has vanishing three-tangle. This technique is developed by making use of the Bloch sphere S 8 of the qutrit system. The Coffman-Kundu-Wootters inequality is dis… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

1
48
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 46 publications
(49 citation statements)
references
References 21 publications
1
48
0
Order By: Relevance
“…However, the residual entanglement for several special mixtures was computed in Ref. [31][32][33][34][35]. More recently, the three-tangle for all GHZ-symmetric states [36] was computed analytically [37].…”
Section: Classification Of Entanglementmentioning
confidence: 99%
“…However, the residual entanglement for several special mixtures was computed in Ref. [31][32][33][34][35]. More recently, the three-tangle for all GHZ-symmetric states [36] was computed analytically [37].…”
Section: Classification Of Entanglementmentioning
confidence: 99%
“…In practice we deal with mixed states rather than pure states due to decoherence effects and hence it is of great importance to study mixed separable states. There exists many important papers [6][7][8][9][10][11][12][13][14] has presented a complete set of 18 local polynomial invariants of two qubit mixed states and demonstrated the usefulness of these invariants to study entanglement. Also, detection of multipartite entanglement has been studied in depth(see for example [18][19][20]).…”
mentioning
confidence: 99%
“…We consider the rank d of the density matrix d, rather than the dimension of the Hilbert space on which it acts, because d is the parameter that determines the computational difficulty of the convex roof minimization. A number of special cases of computation of the convex roof have been solved for cases of restricted rank [11][12][13].Minimal ensembles have been found analytically for the concurrence of arbitrary two-qubit mixed states [8], and for the three-tangle of rank-two mixtures of generalized GHZ and generalized W states [12,13], as well as on rank-three mixtures of a GHZ state, a W state, and a state obtained by flipping all three bits of a W state [14]. When the minimal ensemble is not known analytically, which is the typical case, one may evaluate an upper bound on E(ρ) using, for example, a steepest descent algorithm [15].…”
mentioning
confidence: 99%
“…Minimal ensembles have been found analytically for the concurrence of arbitrary two-qubit mixed states [8], and for the three-tangle of rank-two mixtures of generalized GHZ and generalized W states [12,13], as well as on rank-three mixtures of a GHZ state, a W state, and a state obtained by flipping all three bits of a W state [14]. When the minimal ensemble is not known analytically, which is the typical case, one may evaluate an upper bound on E(ρ) using, for example, a steepest descent algorithm [15].…”
mentioning
confidence: 99%