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:2608.05274

Relative entropy of entanglement of Haar random states

Takato Mori, Beni Yoshida

quant-phhep-thSubmitted Aug 5, 2026• Announced Aug 7, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

Comments
11 pages, comments are welcome

Related papers

Connections between relative entropy of entanglement and geometric measure of entanglement

Tzu-Chieh Wei, Marie Ericsson, Paul M. Goldbart +1 more

As two of the most important entanglement measures---the entanglement of formation and the entanglement of distillation---have so far been limited to bipartite settings, the study of other entanglement measures for multipartite systems appears necessary. Here, connections between two other entanglement measures---the relative entropy of entanglement and the geometric measure of entanglement---are investigated. It is found that for arbitrary pure states the latter gives rise to a lower bound on the former. For certain pure states, some bipartite and some multipartite, this lower bound is saturated, and thus their relative entropy of entanglement can be found analytically in terms of their known geometric measure of entanglement. For certain mixed states, upper bounds on the relative entropy of entanglement are also established. Numerical evidence strongly suggests that these upper bounds are tight, i.e., they are actually the relative entropy of entanglement.

arXiv:quant-ph/0405002•Quantum Information and Computation•Jul 1, 2004•75 citations

Two Theorems on Calculating the Relative Entropy of Entanglement

Shengjun Wu, Wu Qiang, Zhang Yong-De

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.

arXiv:quant-ph/0004018•Chinese Physics Letters•Feb 1, 2001•12 citations

Closest separable state when measured by a quasi-relative entropy

Anna Vershynina

Abstract It is well known that for pure states the relative entropy of entanglement is equal to the reduced entropy, and the closest separable state is explicitly known as well. The same holds for Renyi relative entropy per recent results. We ask the same question for a quasi-relative entropy of entanglement, which is an entanglement measure defined as the minimum distance to the set of separable state, when the distance is measured by the quasi-relative entropy. First, we consider a maximally entangled state, and show that the closest separable state is the same for any quasi-relative entropy as for the relative entropy of entanglement. Then, we show that this also holds for a certain class of functions and any pure state. And at last, we consider any pure state on two qubit systems and a large class of operator convex function. For these, we find the closest separable state, which may not be the same one as for the relative entropy of entanglement.

arXiv:2009.04982•Journal of Physics A Mathematical and Theoretical•Jan 28, 2021•1 citation

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

Relative entropy of entanglement and tripartite minimal surface

Takato Mori, Beni Yoshida

We propose a holographic dual of the relative entropy of entanglement for a boundary tripartition $A:B:C$. Our proposal is that, at the leading order, \begin{align} E_R(ρ_{AB}) = \frac{1}{4G_N}\Big[\mathrm{Area}(Γ_{\min}) - \mathrm{Area}(γ_{AB})\Big] \notag \end{align} where $Γ_{\min}$ is the minimal bulk tripartition surface and $γ_{AB}$ is the minimal surface homologous to $AB$. For a general random tensor network, we prove the corresponding upper bound by constructing a separable state associated with $Γ_{\min}$ and evaluating its relative entropy. We also establish the matching lower bound rigorously for networks of one, two, and three Haar random tensors by bounding the maximal tripartite product-state overlap. In appropriate geometries, the minimal tripartition surface can form a nontrivial tri-junction resembling the Mercedes logo. The proof proceeds by sequential optimization over candidate product states, which has a natural geometric interpretation as a local search for the minimal tripartition surface.

hep-thCross-listedarXiv:2609.38815•Oct 1, 2026•0 citations

Bounds on relative entropy of entanglement for multi-party systems

Martin Bodo Plenio, Vlatko Vedral

We present upper and lower bounds to the relative entropy of entanglement of multi-party systems in terms of the bi-partite entanglements of formation and distillation and entropies of various subsystems. We point out implications of our results to the local reversible convertibility of multi-party pure states and discuss their physical basis in terms of deleting information.

arXiv:quant-ph/0010080•Journal of Physics A Mathematical and General•Aug 24, 2001•81 citations
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.
As two of the most important entanglement measures---the entanglement of formation and the entanglement of distillation---have so far been limited to bipartite settings, the study of other entanglement measures for multipartite systems appears necessary. Here, connections between two other entanglement measures---the relative entropy of entanglement and the geometric measure of entanglement---are investigated. It is found that for arbitrary pure states the latter gives rise to a lower bound on the former. For certain pure states, some bipartite and some multipartite, this lower bound is saturated, and thus their relative entropy of entanglement can be found analytically in terms of their known geometric measure of entanglement. For certain mixed states, upper bounds on the relative entropy of entanglement are also established. Numerical evidence strongly suggests that these upper bounds are tight, i.e., they are actually the relative entropy of entanglement.
Abstract It is well known that for pure states the relative entropy of entanglement is equal to the reduced entropy, and the closest separable state is explicitly known as well. The same holds for Renyi relative entropy per recent results. We ask the same question for a quasi-relative entropy of entanglement, which is an entanglement measure defined as the minimum distance to the set of separable state, when the distance is measured by the quasi-relative entropy. First, we consider a maximally entangled state, and show that the closest separable state is the same for any quasi-relative entropy as for the relative entropy of entanglement. Then, we show that this also holds for a certain class of functions and any pure state. And at last, we consider any pure state on two qubit systems and a large class of operator convex function. For these, we find the closest separable state, which may not be the same one as for the relative entropy of entanglement.
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)].
We propose a holographic dual of the relative entropy of entanglement for a boundary tripartition A:B:CA:B:CA:B:C. Our proposal is that, at the leading order, \begin{align} E_R(ρ_{AB}) = \frac{1}{4G_N}\Big[\mathrm{Area}(Γ_{\min}) - \mathrm{Area}(γ_{AB})\Big] \notag \end{align} where Γmin⁡Γ_{\min}Γmin​ is the minimal bulk tripartition surface and γABγ_{AB}γAB​ is the minimal surface homologous to ABABAB. For a general random tensor network, we prove the corresponding upper bound by constructing a separable state associated with Γmin⁡Γ_{\min}Γmin​ and evaluating its relative entropy. We also establish the matching lower bound rigorously for networks of one, two, and three Haar random tensors by bounding the maximal tripartite product-state overlap. In appropriate geometries, the minimal tripartition surface can form a nontrivial tri-junction resembling the Mercedes logo. The proof proceeds by sequential optimization over candidate product states, which has a natural geometric interpretation as a local search for the minimal tripartition surface.