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/0004018 · Chinese Physics Letters

Two Theorems on Calculating the Relative Entropy of Entanglement

Shengjun Wu, Wu Qiang, Zhang Yong-De

Published Feb 1, 2001• 12 citations
arXivHTMLPDF

Abstract

We present two theorems on calculating the relative entropy of entanglement. Theorem 1 is an extension of Vedral and Plenio's theorem (Phys. Rev. A 57 (1998) 1619) for pure states, which is useful for calculating the relative entropy of entanglement for all pure states as well as for a class of mixed states. Theorem 2 gives the relative entropy of entanglement for any bipartite state whose tripartite purification has two separable reduced bipartite states.

DOI
10.1088/0256-307x/18/2/302

Related papers

Caculating the relative entropy of entanglement

Shengjun Wu, Yongde Zhang

We extend Vedral and Plenio's theorem (theorem 3 in Phys. Rev. A 57, 1619) to a more general case, and obtain the relative entropy of entanglement for a class of mixed states.

•Apr 5, 2000•0 citations

Relative Entropy of Entanglement of One Class of Two-Qubit System

Lin-Mei Liang, Ping‐Xing Chen, Cheng-Zu Li +1 more

The relative entropy of entanglement of a mixed state σ for a bipartite quantum system can be defined as the minimum of the quantum relative entropy over the set of completely disentangled states. Vedral et al. [Phys. Rev. A 57(1998)1619] have recently proposed a numerical method to obtain the relative entropy of entanglement E re for two-qubit systems. This letter shows that the convex programming method can be applied to calculate E re of two-qubit systems analytically, and discusses the conditions under which the method can be adopted.

Chinese Physics Letters•Feb 8, 2001•12 citations

Relative entropy of entanglement of Haar random states

Takato Mori, Beni Yoshida

We determine the relative entropy of entanglement of a bipartite mixed state $ρ_{AB}$ obtained by tracing out one subsystem of a tripartite Haar-random pure state $|ψ\rangle_{ABC}$, finding $E_R(ρ_{AB})=\log\frac{d_Ad_B}{\max(d_A,d_B,d_C)}+O(1)$. Equivalently, the relative entropy of entanglement nearly saturates the smaller of the entanglement of formation $E_F(ρ_{AB})$ and the mutual information $I(A:B)$. The upper bound is achieved by an explicit separable state obtained through one-sided Schmidt dephasing, which is therefore approximately closest.

quant-pharXiv:2608.05274•Aug 7, 2026•0 citations

Tripartite entanglement and quantum relative entropy

Ernesto F. Galvão, Martin Bodo Plenio, S. Virmani

We establish relations between tripartite pure state entanglement and additivity properties of the bipartite relative entropy of entanglement. Our results pertain to the asymptotic limit of local manipulations on a large number of copies of the state. We show that additivity of the relative entropy would imply that there are at least two inequivalent types of asymptotic tripartite entanglement. The methods used include the application of some useful lemmas that enable us to analytically calculate the relative entropy for some classes of bipartite states.

arXiv:quant-ph/0008089•Journal of Physics A Mathematical and General•Nov 24, 2000•36 citations

An explicit expression for the relative entropy of entanglement in all dimensions

Shmuel Friedland, Gilad Gour

The relative entropy of entanglement is defined in terms of the relative entropy between an entangled state and its closest separable state (CSS). Given a multipartite-state on the boundary of the set of separable states, we find an explicit expression for all the entangled states for which this state is a CSS. Our formula holds for multipartite states in all dimensions. For the bipartite case of two qubits, our formula reduce to the one given by Miranowicz and Ishizaka [Phys. Rev. A 78, 032310 (2008)].

arXiv:1007.4544•Journal of Mathematical Physics•May 1, 2011•30 citations

Entanglement and entropy in multipartite systems: a useful approach

Alexander Bernal, J.A. Casas, Jesús M. Moreno

Abstract Quantum entanglement and quantum entropy are crucial concepts in the study of multipartite quantum systems. In this work, we show how the notion of concurrence vector, re-expressed in a particularly useful form, provides new insights and computational tools for the analysis of both. In particular, using this approach for a general multipartite pure state, one can easily prove known relations in an easy way and to build up new relations between the concurrences associated with the different bipartitions. The approach is also useful to derive sufficient conditions for genuine entanglement in generic multipartite systems that are computable in polynomial time. From an entropy-of-entanglement perspective, the approach is powerful to prove properties of the Tsallis-2 entropy, such as the subadditivity, and to derive new ones, e.g., a modified version of the strong subadditivity which is always fulfilled; thanks to the purification theorem these results hold for any multipartite state, whether pure or mixed.

arXiv:2307.05205•Quantum Information Processing•Feb 9, 2024•6 citations
We present two theorems on calculating the relative entropy of entanglement. Theorem 1 is an extension of Vedral and Plenio's theorem (Phys. Rev. A 57 (1998) 1619) for pure states, which is useful for calculating the relative entropy of entanglement for all pure states as well as for a class of mixed states. Theorem 2 gives the relative entropy of entanglement for any bipartite state whose tripartite purification has two separable reduced bipartite states.
The relative entropy of entanglement of a mixed state σ for a bipartite quantum system can be defined as the minimum of the quantum relative entropy over the set of completely disentangled states. Vedral et al. [Phys. Rev. A 57(1998)1619] have recently proposed a numerical method to obtain the relative entropy of entanglement E re for two-qubit systems. This letter shows that the convex programming method can be applied to calculate E re of two-qubit systems analytically, and discusses the conditions under which the method can be adopted.
We determine the relative entropy of entanglement of a bipartite mixed state ρABρ_{AB}ρAB​ obtained by tracing out one subsystem of a tripartite Haar-random pure state ∣ψ⟩ABC|ψ\rangle_{ABC}∣ψ⟩ABC​, finding ER(ρAB)=log⁡dAdBmax⁡(dA,dB,dC)+O(1)E_R(ρ_{AB})=\log\frac{d_Ad_B}{\max(d_A,d_B,d_C)}+O(1)ER​(ρAB​)=logmax(dA​,dB​,dC​)dA​dB​​+O(1). Equivalently, the relative entropy of entanglement nearly saturates the smaller of the entanglement of formation EF(ρAB)E_F(ρ_{AB})EF​(ρAB​) and the mutual information I(A:B)I(A:B)I(A:B). The upper bound is achieved by an explicit separable state obtained through one-sided Schmidt dephasing, which is therefore approximately closest.
We establish relations between tripartite pure state entanglement and additivity properties of the bipartite relative entropy of entanglement. Our results pertain to the asymptotic limit of local manipulations on a large number of copies of the state. We show that additivity of the relative entropy would imply that there are at least two inequivalent types of asymptotic tripartite entanglement. The methods used include the application of some useful lemmas that enable us to analytically calculate the relative entropy for some classes of bipartite states.
The relative entropy of entanglement is defined in terms of the relative entropy between an entangled state and its closest separable state (CSS). Given a multipartite-state on the boundary of the set of separable states, we find an explicit expression for all the entangled states for which this state is a CSS. Our formula holds for multipartite states in all dimensions. For the bipartite case of two qubits, our formula reduce to the one given by Miranowicz and Ishizaka [Phys. Rev. A 78, 032310 (2008)].
Abstract Quantum entanglement and quantum entropy are crucial concepts in the study of multipartite quantum systems. In this work, we show how the notion of concurrence vector, re-expressed in a particularly useful form, provides new insights and computational tools for the analysis of both. In particular, using this approach for a general multipartite pure state, one can easily prove known relations in an easy way and to build up new relations between the concurrences associated with the different bipartitions. The approach is also useful to derive sufficient conditions for genuine entanglement in generic multipartite systems that are computable in polynomial time. From an entropy-of-entanglement perspective, the approach is powerful to prove properties of the Tsallis-2 entropy, such as the subadditivity, and to derive new ones, e.g., a modified version of the strong subadditivity which is always fulfilled; thanks to the purification theorem these results hold for any multipartite state, whether pure or mixed.