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:quant-ph/0302018

An efficient numerical method for calculating the entanglement of formation of arbitrary mixed quantum states of any dimension

J. R. Gittings, Andrew J. Fisher

Published Feb 3, 2003• 5 citations
arXivHTMLPDF

Abstract

We present a conjugate gradient method for calculating the entanglement of formation of arbitrary mixed quantum states of any dimension and with any bipartite division of the Hilbert space. The development of the gradient used by the algorithm, its implications for the number of states required in the optimal decomposition, and the way that conjugate gradient minimization has been adapted for this particular problem are outlined. We have found that the algorithm exhibits linear convergence for general mixed states, and that it correctly reproduces the known results for pairs of qubits and for isotropic states. The results of an example application of the code are discussed: calculating the entanglement of formation of a Psi+ Bell state of two qutrits when one of those qutrits is subject to various decoherence channels. The results for qutrits are contrasted with those for qubits: for the types of decoherence considered here, qutrit entanglement appears to be more robust than qubit entanglement.

DOI
10.48550/arxiv.quant-ph/0302018

Related papers

Analytic computation of the entanglement of formation for bipartite isotropic states using their symmetry

Y. Akbari-Kourbolagh, E. Shahhoseini

Abstract It is well-known that computing the entanglement of formation of a general bipartite state is a difficult task. We use the local symmetry of bipartite isotropic states in arbitrary dimensions to compute their entanglement of formation analytically. Our computation is an explicit and detailed version of the computation performed by Terhal et al [B. M. Terhal and K. G. H. Vollbrecht, Phys. Rev. Lett. 85, 2625 (2000)]. However, it is not just a review but we also have our contribution and novelty. For instance, we provide a rigorous proof for the entanglement of formation of two qutrit isotropic states and notably we give a proof supporting the conjecture proposed by Terhal et al about the entanglement of formation of bipartite isotropic states for the last range of allowed parameter values.

Physica Scripta•Jun 10, 2024•0 citations

R function related to entanglement of formation

Shao-Ming Fei, Xianqing Li‐Jost

By investigating the convex property of the function $R$, which appeared when computing the entanglement of formation for isotropic states [Phys. Rev. Lett. 85, 2625 (2000)] and in a tight lower bound of entanglement of formation for arbitrary bipartite mixed states [Phys. Rev. Lett. 95, 210501 (2005)], we show analytically that the results in these papers are valid not only for dimensions two and three but for any dimensions.

arXiv:quant-ph/0602137•Physical Review A•Feb 10, 2006•17 citations

Quantum entanglement of formation between qudits

Seunghwa Ryu, Wei Cai A, Alfredo Caro

We develop a fast algorithm to calculate the entanglement of formation of a mixed state, which is defined as the minimum average entanglement of the pure states that form the mixed state. The algorithm combines conjugat-gradient and steepest-descent algorithms and outperforms both. Using this new algorithm, we obtain the statistics of the entanglement of formation on ensembles of random density matrices of higher dimensions than possible before. The correlation between the entanglement of formation and other quantities that are easier to compute, such as participation ratio and negativity are presented. Our results suggest a higher percentage of zero-entanglement states among zero-negativity states than previously reported.

Physical Review A•May 12, 2008•15 citations

Entanglement of formation for a family of (2⊗d) -dimensional systems

F. Lastra, C. E. López, Luis Roa +1 more

Entanglement of formation for arbitrary mixed states in a ($2\ensuremath{\bigotimes}2$)-dimensional Hilbert space is well known. For higher-dimensional mixed states analytical expressions for quantifying entanglement exist for a particular family of states. In this work, we calculate analytically the entanglement of formation for a family of bipartite ($2\ensuremath{\bigotimes}d$)-dimensional mixed states which can be obtained from tripartite $2\ensuremath{\bigotimes}2\ensuremath{\bigotimes}d$ pure states following the entanglement relations obtained by Koashi and Winter [Phys. Rev. A 69, 022309 (2004)].

arXiv:1105.6321•Physical Review A•Feb 15, 2012•18 citations

Simulated annealing and entanglement of formation for (n⊗m) -dimensional mixed states

S. Allende, D. Altbir, J. C. Retamal

The simulated annealing algorithm, a method commonly used to calculate properties of condensed-matter systems, is used to calculate entanglement of formation for higher-dimensional mixed states. The method relies on representing a mixed state as a pure state in an enlarged Hilbert space, and on the search for the extension minimizing the convex roof of entanglement of formation. Exact results are found, and predictions for system reservoir dynamics in higher dimensions are confirmed. These findings open the way for new applications of the method in quantum information.

Physical Review A•Aug 24, 2015•7 citations

Entanglement Cost of Bipartite Mixed States

Guifré Vidal, Wolfgang Dür, J. I. Cirac

We compute the entanglement cost of several families of bipartite mixed states, including arbitrary mixtures of two Bell states. This is achieved by developing a technique that allows us to ascertain the additivity of the entanglement of formation for any state supported on specific subspaces. As a side result, the proof of the irreversibility in asymptotic local manipulations of entanglement is extended to two-qubit systems.

arXiv:quant-ph/0112131•Physical Review Letters•Jun 20, 2002•160 citations
We present a conjugate gradient method for calculating the entanglement of formation of arbitrary mixed quantum states of any dimension and with any bipartite division of the Hilbert space. The development of the gradient used by the algorithm, its implications for the number of states required in the optimal decomposition, and the way that conjugate gradient minimization has been adapted for this particular problem are outlined. We have found that the algorithm exhibits linear convergence for general mixed states, and that it correctly reproduces the known results for pairs of qubits and for isotropic states. The results of an example application of the code are discussed: calculating the entanglement of formation of a Psi+ Bell state of two qutrits when one of those qutrits is subject to various decoherence channels. The results for qutrits are contrasted with those for qubits: for the types of decoherence considered here, qutrit entanglement appears to be more robust than qubit entanglement.
Abstract It is well-known that computing the entanglement of formation of a general bipartite state is a difficult task. We use the local symmetry of bipartite isotropic states in arbitrary dimensions to compute their entanglement of formation analytically. Our computation is an explicit and detailed version of the computation performed by Terhal et al [B. M. Terhal and K. G. H. Vollbrecht, Phys. Rev. Lett. 85, 2625 (2000)]. However, it is not just a review but we also have our contribution and novelty. For instance, we provide a rigorous proof for the entanglement of formation of two qutrit isotropic states and notably we give a proof supporting the conjecture proposed by Terhal et al about the entanglement of formation of bipartite isotropic states for the last range of allowed parameter values.
By investigating the convex property of the function RRR, which appeared when computing the entanglement of formation for isotropic states [Phys. Rev. Lett. 85, 2625 (2000)] and in a tight lower bound of entanglement of formation for arbitrary bipartite mixed states [Phys. Rev. Lett. 95, 210501 (2005)], we show analytically that the results in these papers are valid not only for dimensions two and three but for any dimensions.
We develop a fast algorithm to calculate the entanglement of formation of a mixed state, which is defined as the minimum average entanglement of the pure states that form the mixed state. The algorithm combines conjugat-gradient and steepest-descent algorithms and outperforms both. Using this new algorithm, we obtain the statistics of the entanglement of formation on ensembles of random density matrices of higher dimensions than possible before. The correlation between the entanglement of formation and other quantities that are easier to compute, such as participation ratio and negativity are presented. Our results suggest a higher percentage of zero-entanglement states among zero-negativity states than previously reported.
Entanglement of formation for arbitrary mixed states in a ($2\ensuremath{\bigotimes}2$)-dimensional Hilbert space is well known. For higher-dimensional mixed states analytical expressions for quantifying entanglement exist for a particular family of states. In this work, we calculate analytically the entanglement of formation for a family of bipartite ($2\ensuremath{\bigotimes}d$)-dimensional mixed states which can be obtained from tripartite $2\ensuremath{\bigotimes}2\ensuremath{\bigotimes}d$ pure states following the entanglement relations obtained by Koashi and Winter [Phys. Rev. A 69, 022309 (2004)].
The simulated annealing algorithm, a method commonly used to calculate properties of condensed-matter systems, is used to calculate entanglement of formation for higher-dimensional mixed states. The method relies on representing a mixed state as a pure state in an enlarged Hilbert space, and on the search for the extension minimizing the convex roof of entanglement of formation. Exact results are found, and predictions for system reservoir dynamics in higher dimensions are confirmed. These findings open the way for new applications of the method in quantum information.