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

Bulletin of the American Physical Society

Numerical Calculations of the Three Tangle for Mixed States

Samuel G. Rodriques, Peter J. Love

Published Mar 21, 2013• 0 citations
OpenAlex

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•23 citations

DENSITY MATRICES AND MIXED STATES

Elsevier eBooks•Jan 1, 1975•0 citations

Geometry of the set of mixed states

Guillaume Aubrun, Stanisław Szarek

Mathematical surveys and monographs•Aug 30, 2017•0 citations

Numerical Determination of the Three-Tangle of Mixed States

Sameh M. Saad

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.

•Aug 31, 2015•0 citations

Three-tangle of assistance

Xi-Jun Ren, Zhen Wang, Xingxiang Zhou +2 more

In this report, we calculate the three tangle of assistance and give the corresponding best possible pure state decomposition of rank-two mixed states for the three-qubit Greenberger-Horne-Zeilinger (GHZ) state and $W$ state. As the three tangle can be transformed into bipartite concurrence with assistance, we achieve a lower bound of the assisted concurrence with local operations and classical communication (LOCC) constraints via these pure state decompositions. It is smaller than the total assisted concurrence, which shows that local assistance alone is not sufficient for maximizing bipartite entanglement. The increase of three tangle is attributed to the genuine multipartite entanglement in the purified state. A genuine four-qubit entanglement measure is calculated for the purified four-qubit state and compared to the three tangle of assistance.

Physical Review A•Apr 13, 2010•3 citations

Stronger uncertainty relations of mixed states

Yajing Fan, Huaixin Cao, Liang Chen +1 more

Quantum Information Processing•Jul 23, 2020•3 citations
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.
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.
In this report, we calculate the three tangle of assistance and give the corresponding best possible pure state decomposition of rank-two mixed states for the three-qubit Greenberger-Horne-Zeilinger (GHZ) state and WWW state. As the three tangle can be transformed into bipartite concurrence with assistance, we achieve a lower bound of the assisted concurrence with local operations and classical communication (LOCC) constraints via these pure state decompositions. It is smaller than the total assisted concurrence, which shows that local assistance alone is not sufficient for maximizing bipartite entanglement. The increase of three tangle is attributed to the genuine multipartite entanglement in the purified state. A genuine four-qubit entanglement measure is calculated for the purified four-qubit state and compared to the three tangle of assistance.