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

Numerical Determination of the Three-Tangle of Mixed States

Sameh M. Saad

Published Aug 31, 2015• 0 citations
OpenAlex

Abstract

This thesis presents a numerical method for computing the two-tangle and three-tangle of mixed states.A target function is constructed for both the two-tangle and three-tangle of mixed states, where a number of constraints have been introduced in order to make sure that the whole construct makes physical sense.The target function is then minimized by means of the COBYLA algorithm, and tested by comparison with known analytical results.The numerical computation of the twotangle shows good agreement with the analytical results.As for the three-tangle, it can be reasonably approximated by the COBYLA algorithm, given that the algorithm is allowed to run for some time.Presumably, an increasingly better approximation to the analytical results will be obtained by increasing the allowed computation time.

Related papers

Efficient numerical method to calculate the three-tangle of mixed states

Kun Cao, Zheng-Wei Zhou, Guang‐Can Guo +1 more

We demonstrate an efficient numerical method to calculate the three-tangle of general mixed states. We construct an ``energy function'' (target function) for the three-tangle of the mixed state under certain constraints. The energy function (target function) is then optimized via the replica exchange Monte Carlo method. We have extensively tested the method for the examples with known analytical results, showing remarkable agreement. The method can be applied to other optimization problems in quantum information theory.

arXiv:1001.0067•Physical Review A•Mar 25, 2010•24 citations

Practical method to obtain a lower bound to the three-tangle

Christopher Eltschka, Jens Siewert

The quantitative assessment of the entanglement in multipartite quantum states is, apart from its fundamental importance, a practical problem. Recently there has been significant progress in developing new methods to determine certain entanglement measures. In particular, there is a method---in principle, analytical---to compute a certified lower bound for the three-tangle. The purpose of this work is to provide a manual for the implementation of this approach and to explicitly discuss several analytically solvable cases in order to gauge the numerical tools. Moreover, we derive a simple analytical bound for the mixed-state three-tangle.

arXiv:1310.8311•Physical Review A•Feb 12, 2014•20 citations

How to practically obtain a lower bound to the three-tangle

Christopher Eltschka, Jens Siewert

The quantitative assessment of the entanglement in multipartite quantum states is, apart from its fundamental importance, a practical problem. Recently there has been significant progress in developing new methods to determine certain entanglement measures. In particular, there is an - in principle analytical - method to compute a certified lower bound for the three-tangle. The purpose of this work is to provide a manual for the implementation of this approach and to explicitly discuss several analytically solvable cases in order to gauge the numerical tools. Moreover, we derive a simple analytical bound for the mixed state three-tangle.

•Oct 30, 2013•0 citations

Analytically computable tangle for three-qubit mixed states

Hiroyasu Tajima

We present a new tripartite entanglement measure for three-qubit mixed states. The new measure $t_{\mathrm{r}}(ρ)$, which we refer to as the r-tangle, is given as a kind of the tangle, but has a feature which the tangle does not have; if we can derive an analytical form of $ t_{\mathrm{r}}(ρ)$ for a three-qubit mixed state $ρ$, we can also derive $t_{\mathrm{r}}(ρ')$ analytically for any states $ρ'$ which are SLOCC-equivalent to the state $ρ$. The concurrence of two-qubit states also satisfies the feature, but the tangle does not. These facts imply that the r-tangle $t_{\mathrm{r}}$ is the appropriate three-partite counterpart of the concurrence. We also derive an analytical form of the r-tangle $t_{\mathrm{r}}$ for mixtures of a generalized GHZ state and a generalized W state, and hence for all states which are SLOCC-equivalent to them.

arXiv:1308.5488•Aug 26, 2013•0 citations

Three-Tangle for High-Rank Mixed States

Shu-Juan He, Xiaohong Wang, Shao-Ming Fei +2 more

A family of rank-n (n = 5,6,7,8) three-qubit mixed states are constructed. The explicit expressions for the three-tangle and optimal decompositions for all these states are given. The CKW relations for these states are also discussed.

arXiv:1102.5402•Communications in Theoretical Physics•Feb 1, 2011•16 citations

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

Eylee Jung, Mi-Ra Hwang, DaeKil Park +1 more

Three-tangle for a rank-3 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 discussed by computing one-tangle and concurrences. It is shown that the one-tangle is always larger than the sum of squared concurrences and three-tangle. The physical implication of three-tangle is briefly discussed.

arXiv:0810.5403•Physical Review A•Feb 11, 2009•48 citations
This thesis presents a numerical method for computing the two-tangle and three-tangle of mixed states.A target function is constructed for both the two-tangle and three-tangle of mixed states, where a number of constraints have been introduced in order to make sure that the whole construct makes physical sense.The target function is then minimized by means of the COBYLA algorithm, and tested by comparison with known analytical results.The numerical computation of the twotangle shows good agreement with the analytical results.As for the three-tangle, it can be reasonably approximated by the COBYLA algorithm, given that the algorithm is allowed to run for some time.Presumably, an increasingly better approximation to the analytical results will be obtained by increasing the allowed computation time.
We demonstrate an efficient numerical method to calculate the three-tangle of general mixed states. We construct an ``energy function'' (target function) for the three-tangle of the mixed state under certain constraints. The energy function (target function) is then optimized via the replica exchange Monte Carlo method. We have extensively tested the method for the examples with known analytical results, showing remarkable agreement. The method can be applied to other optimization problems in quantum information theory.
The quantitative assessment of the entanglement in multipartite quantum states is, apart from its fundamental importance, a practical problem. Recently there has been significant progress in developing new methods to determine certain entanglement measures. In particular, there is a method---in principle, analytical---to compute a certified lower bound for the three-tangle. The purpose of this work is to provide a manual for the implementation of this approach and to explicitly discuss several analytically solvable cases in order to gauge the numerical tools. Moreover, we derive a simple analytical bound for the mixed-state three-tangle.
The quantitative assessment of the entanglement in multipartite quantum states is, apart from its fundamental importance, a practical problem. Recently there has been significant progress in developing new methods to determine certain entanglement measures. In particular, there is an - in principle analytical - method to compute a certified lower bound for the three-tangle. The purpose of this work is to provide a manual for the implementation of this approach and to explicitly discuss several analytically solvable cases in order to gauge the numerical tools. Moreover, we derive a simple analytical bound for the mixed state three-tangle.
We present a new tripartite entanglement measure for three-qubit mixed states. The new measure tr(ρ)t_{\mathrm{r}}(ρ)tr​(ρ), which we refer to as the r-tangle, is given as a kind of the tangle, but has a feature which the tangle does not have; if we can derive an analytical form of $ t_{\mathrm{r}}(ρ)$ for a three-qubit mixed state ρρρ, we can also derive tr(ρ′)t_{\mathrm{r}}(ρ')tr​(ρ′) analytically for any states ρ′ρ'ρ′ which are SLOCC-equivalent to the state ρρρ. The concurrence of two-qubit states also satisfies the feature, but the tangle does not. These facts imply that the r-tangle trt_{\mathrm{r}}tr​ is the appropriate three-partite counterpart of the concurrence. We also derive an analytical form of the r-tangle trt_{\mathrm{r}}tr​ for mixtures of a generalized GHZ state and a generalized W state, and hence for all states which are SLOCC-equivalent to them.
Three-tangle for a rank-3 mixture composed of Greenberger-Horne-Zeilinger, WWW, and flipped-WWW 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 S8{S}^{8}S8 of the qutrit system. The Coffman-Kundu-Wootters inequality is discussed by computing one-tangle and concurrences. It is shown that the one-tangle is always larger than the sum of squared concurrences and three-tangle. The physical implication of three-tangle is briefly discussed.