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

The entanglement of purification is not additive

Artus Krohn-Grimberghe

quant-phSubmitted Aug 25, 2026• Announced Aug 26, 2026• 0 citations
arXivHTMLPDF

Abstract

The entanglement of purification $E_P$, introduced by Terhal, Horodecki, Leung, and DiVincenzo in 2002, measures the total correlations of a bipartite state by the entanglement needed to purify it; whether it is additive on tensor powers has been open since its introduction. In 2012 Chen and Winter argued "beyond reasonable doubt", from numerical evidence, that the two-qubit Werner state at singlet fraction $f = 1/200$ is a counterexample, and explicitly left a completely rigorous proof to future work. To our knowledge we give the first rigorous proof: for this state $W$, $E_P^\infty(W) \le 0.9663\ldots < 97/100 < E_P(W)$, hence the entanglement of purification is strictly nonadditive at some finite tensor power. The lower bound is a finite certificate: analytic reductions send the Schmidt spectrum of every purification in the complete complex Stiefel domain to a point satisfying explicit necessary inequalities in a three-dimensional box, and an exact-rational subdivision of that box has 25,383 leaves, each of which either excludes nonphysical points or proves the entropy bound. The upper bound combines an exact symmetric-support endpoint, an explicit feasible isometry, and a convexity theorem for the regularized quantity, closed by two directed rational logarithm certificates. Every computer-assisted certificate reduces to integer comparisons; a dependency-free program verifies all of them from the supplementary artifact.

Comments
24 pages; verification artifact archived at doi:10.5281/zenodo.22097511

Related papers

Entanglement of purification for Werner states: canonical purification and nonadditivity

Zahra Baghali Khanian, Amir-Reza Negari

We prove that the von Neumann entanglement of purification is nonadditive. For two-qubit Werner states $W(f)$ with singlet weight $1/64\le f\le1/4$, we show that canonical purification is globally optimal: its entanglement, also known as reflected entropy, gives the exact entanglement of purification. In contrast, the regularized entanglement of purification lies strictly below the reflected entropy for $0<f<f_\ast$, where $f_\ast\approx0.017$. Together, these results establish nonadditivity throughout $1/64\le f<f_\ast$. Our canonical-optimality proof generalizes the proof in [1], which established Rényi nonadditivity for $0\leα<1$ using classical two-qubit states. We thus resolve the additivity question at $α=1$. Remarkably, nonadditivity is again witnessed by separable states and no entanglement in the underlying states is required.

quant-pharXiv:2610.03630•Oct 5, 2026•0 citations

Rényi Entanglement of Purification Is Non-additive

Amir-Reza Negari, Zahra Baghali Khanian

Entanglement of purification is a fundamental measure of total correlations whose additivity remains unresolved. We study its additivity for classical states on two qubits at different Rényi orders. For every $α\in[0,1)$, we prove nonadditivity within this family, witnessed by two copies of a single state. We first solve the one-copy optimization exactly for the entire family at every Rényi order. We then restrict the two-copy optimization to a natural finite set of purifications and exhibit one whose entropy is strictly below the product value. In contrast, for $α\in[2,\infty]$ we prove additivity under tensor products within this family. The interval $α\in[1,2)$, including the von Neumann case $α=1$, remains open, and we conjecture additivity there throughout the same family.

quant-pharXiv:2608.28897•Sep 1, 2026•0 citations

Non-Additivity of the Entanglement of Purification (Beyond Reasonable Doubt)

Jianxin Chen, Andreas Winter

We demonstrate the convexity of the difference between the regularized entanglement of purification and the entropy, as a function of the state. This is proved by means of a new asymptotic protocol to prepare a state from pre-shared entanglement and by local operations only. We go on to employ this convexity property in an investigation of the additivity of the (single-copy) entanglement of purification: using numerical results for two-qubit Werner states we find strong evidence that the entanglement of purification is different from its regularization, hence that entanglement of purification is not additive.

arXiv:1206.1307•Jun 6, 2012•9 citations

Additivity Results for the Rényi-2 Entanglement of Purification

Shokoufe Faraji, Zahra Baghali Khanian

We reformulate the Rényi entanglement of purification as a constrained minimum output Rényi entropy problem. Equivalently, for $p>1$, this formulation can be expressed in terms of a constrained maximal output Schatten $p$-norm. More precisely, for a completely positive map $Ω:L(B')\to L(A)$, we consider the quantity $\upsilon_p(Ω)$ defined by optimizing $\|(Ω\otimes \mathrm{id}_E)(σ^{B'E})\|_p$ over all bipartite states $σ^{B'E}$ whose $B'$-marginal is maximally mixed. We focus on the case $p=2$. First, we compute $\upsilon_2$ for the transpose-depolarizing channel and prove that it is multiplicative under tensor powers. We then establish a general multiplicativity criterion: whenever a completely positive map $N:L(B')\to L(A)$ satisfies $N^{\dagger} \mathbin{\circ} N=a\,\mathrm{id}_A+b\,\mathrm{Tr}[\cdot]\,I_d$ for some constants $a,b\ge 0$, where $N^{\dagger}$ denotes the Hilbert-Schmidt adjoint of $N$, the quantity $\upsilon_2(N)$ is multiplicative under tensor powers. Examples of channels satisfying this criterion include the transpose-depolarizing channel, the depolarizing channel, and their respective complementary channels. Furthermore, we show that, for every completely positive map $Ω$, multiplicativity of $\upsilon_p(Ω)$ implies multiplicativity for its complementary map. This yields the corresponding additivity statements for the associated Rényi-2 entanglement of purification.

quant-pharXiv:2605.15439•May 18, 2026•0 citations

Exact certification of a positive-order Rényi additivity violation for an explicit channel pair

Artus Krohn-Grimberghe

Cubitt, Harrow, Leung, Montanaro, and Winter (CHLMW) exhibited an explicit pair of quantum channels whose minimum output Rényi entropy is nonadditive at order zero, and reported numerical violations at positive orders close to zero. Their paper states that a semidefinite-programming argument yields a rigorous positive-order interval for the same example, without printing the endpoint or a verifiable certificate; a recent paper by Leung, Lovitz, and Wu records that for this pair "no rigorous endpoint was obtained". We close that gap for the trace-preserving normalization of the printed pair fixed in Section 2. Small rational witness matrices prove that every output of either channel has all eigenvalues between $301/100000$ and $2/3$; a single explicit entangled input has an exact rational joint output spectrum of rank eight; and two independent elementary interval arguments turn these three facts into a proof of strict additivity violation, $S_p^{\min}(\mathrm{N}_R\otimes\mathrm{N}_{\bar S}) < S_p^{\min}(\mathrm{N}_R)+S_p^{\min}(\mathrm{N}_{\bar S}),$ for every real order $0<p\le 1/22$. Every step of the verification reduces to comparisons of integers, and the complete certificate is a few small rational matrices that a reader can check with a short program -- or, for any single order, by hand. To our knowledge, consistent with the assessment of Leung, Lovitz, and Wu, this is the first printed, computer-verifiable certified positive-order endpoint for this explicit pair. We claim no novelty for the phenomenon or for the eigenvalue-floor mechanism, both due to CHLMW, and no optimality of the endpoint.

quant-pharXiv:2608.17376•Aug 19, 2026•0 citations

Monogamy, polygamy, and other properties of entanglement of purification

Shrobona Bagchi, Arun Kumar Pati

For bipartite pure and mixed quantum states, in addition to the quantum mutual information, there is another measure of total correlation, namely, the entanglement of purification. We study the monogamy, polygamy, and additivity properties of the entanglement of purification for pure and mixed states. In this paper, we show that, in contrast to the quantum mutual information which is strictly monogamous for any tripartite pure states, the entanglement of purification is polygamous for the same. This shows that there can be genuinely two types of total correlation across any bipartite cross in a pure tripartite state. Furthermore, we find the lower bound and actual values of the entanglement of purification for different classes of tripartite and higher-dimensional bipartite mixed states. Thereafter, we show that if entanglement of purification is not additive on tensor product states, it is actually subadditive. Using these results, we identify some states which are additive on tensor products for entanglement of purification. The implications of these findings on the quantum advantage of dense coding are briefly discussed, whereby we show that for tripartite pure states, it is strictly monogamous and if it is nonadditive, then it is superadditive on tensor product states.

arXiv:1502.01272•Physical Review A•Apr 16, 2015•36 citations
The entanglement of purification EPE_PEP​, introduced by Terhal, Horodecki, Leung, and DiVincenzo in 2002, measures the total correlations of a bipartite state by the entanglement needed to purify it; whether it is additive on tensor powers has been open since its introduction. In 2012 Chen and Winter argued "beyond reasonable doubt", from numerical evidence, that the two-qubit Werner state at singlet fraction f=1/200f = 1/200f=1/200 is a counterexample, and explicitly left a completely rigorous proof to future work. To our knowledge we give the first rigorous proof: for this state WWW, EP∞(W)≤0.9663…<97/100<EP(W)E_P^\infty(W) \le 0.9663\ldots < 97/100 < E_P(W)EP∞​(W)≤0.9663…<97/100<EP​(W), hence the entanglement of purification is strictly nonadditive at some finite tensor power. The lower bound is a finite certificate: analytic reductions send the Schmidt spectrum of every purification in the complete complex Stiefel domain to a point satisfying explicit necessary inequalities in a three-dimensional box, and an exact-rational subdivision of that box has 25,383 leaves, each of which either excludes nonphysical points or proves the entropy bound. The upper bound combines an exact symmetric-support endpoint, an explicit feasible isometry, and a convexity theorem for the regularized quantity, closed by two directed rational logarithm certificates. Every computer-assisted certificate reduces to integer comparisons; a dependency-free program verifies all of them from the supplementary artifact.
We prove that the von Neumann entanglement of purification is nonadditive. For two-qubit Werner states W(f)W(f)W(f) with singlet weight 1/64≤f≤1/41/64\le f\le1/41/64≤f≤1/4, we show that canonical purification is globally optimal: its entanglement, also known as reflected entropy, gives the exact entanglement of purification. In contrast, the regularized entanglement of purification lies strictly below the reflected entropy for 0<f<f∗0<f<f_\ast0<f<f∗​, where f∗≈0.017f_\ast\approx0.017f∗​≈0.017. Together, these results establish nonadditivity throughout 1/64≤f<f∗1/64\le f<f_\ast1/64≤f<f∗​. Our canonical-optimality proof generalizes the proof in [1], which established Rényi nonadditivity for 0≤α<10\leα<10≤α<1 using classical two-qubit states. We thus resolve the additivity question at α=1α=1α=1. Remarkably, nonadditivity is again witnessed by separable states and no entanglement in the underlying states is required.
Entanglement of purification is a fundamental measure of total correlations whose additivity remains unresolved. We study its additivity for classical states on two qubits at different Rényi orders. For every α∈[0,1)α\in[0,1)α∈[0,1), we prove nonadditivity within this family, witnessed by two copies of a single state. We first solve the one-copy optimization exactly for the entire family at every Rényi order. We then restrict the two-copy optimization to a natural finite set of purifications and exhibit one whose entropy is strictly below the product value. In contrast, for α∈[2,∞]α\in[2,\infty]α∈[2,∞] we prove additivity under tensor products within this family. The interval α∈[1,2)α\in[1,2)α∈[1,2), including the von Neumann case α=1α=1α=1, remains open, and we conjecture additivity there throughout the same family.
We demonstrate the convexity of the difference between the regularized entanglement of purification and the entropy, as a function of the state. This is proved by means of a new asymptotic protocol to prepare a state from pre-shared entanglement and by local operations only. We go on to employ this convexity property in an investigation of the additivity of the (single-copy) entanglement of purification: using numerical results for two-qubit Werner states we find strong evidence that the entanglement of purification is different from its regularization, hence that entanglement of purification is not additive.
We reformulate the Rényi entanglement of purification as a constrained minimum output Rényi entropy problem. Equivalently, for p>1p>1p>1, this formulation can be expressed in terms of a constrained maximal output Schatten ppp-norm. More precisely, for a completely positive map Ω:L(B′)→L(A)Ω:L(B')\to L(A)Ω:L(B′)→L(A), we consider the quantity υp(Ω)\upsilon_p(Ω)υp​(Ω) defined by optimizing ∥(Ω⊗idE)(σB′E)∥p\|(Ω\otimes \mathrm{id}_E)(σ^{B'E})\|_p∥(Ω⊗idE​)(σB′E)∥p​ over all bipartite states σB′Eσ^{B'E}σB′E whose B′B'B′-marginal is maximally mixed. We focus on the case p=2p=2p=2. First, we compute υ2\upsilon_2υ2​ for the transpose-depolarizing channel and prove that it is multiplicative under tensor powers. We then establish a general multiplicativity criterion: whenever a completely positive map N:L(B′)→L(A)N:L(B')\to L(A)N:L(B′)→L(A) satisfies N†∘N=a idA+b Tr[⋅] IdN^{\dagger} \mathbin{\circ} N=a\,\mathrm{id}_A+b\,\mathrm{Tr}[\cdot]\,I_dN†∘N=aidA​+bTr[⋅]Id​ for some constants a,b≥0a,b\ge 0a,b≥0, where N†N^{\dagger}N† denotes the Hilbert-Schmidt adjoint of NNN, the quantity υ2(N)\upsilon_2(N)υ2​(N) is multiplicative under tensor powers. Examples of channels satisfying this criterion include the transpose-depolarizing channel, the depolarizing channel, and their respective complementary channels. Furthermore, we show that, for every completely positive map ΩΩΩ, multiplicativity of υp(Ω)\upsilon_p(Ω)υp​(Ω) implies multiplicativity for its complementary map. This yields the corresponding additivity statements for the associated Rényi-2 entanglement of purification.
Cubitt, Harrow, Leung, Montanaro, and Winter (CHLMW) exhibited an explicit pair of quantum channels whose minimum output Rényi entropy is nonadditive at order zero, and reported numerical violations at positive orders close to zero. Their paper states that a semidefinite-programming argument yields a rigorous positive-order interval for the same example, without printing the endpoint or a verifiable certificate; a recent paper by Leung, Lovitz, and Wu records that for this pair "no rigorous endpoint was obtained". We close that gap for the trace-preserving normalization of the printed pair fixed in Section 2. Small rational witness matrices prove that every output of either channel has all eigenvalues between 301/100000301/100000301/100000 and 2/32/32/3; a single explicit entangled input has an exact rational joint output spectrum of rank eight; and two independent elementary interval arguments turn these three facts into a proof of strict additivity violation, Spmin⁡(NR⊗NSˉ)<Spmin⁡(NR)+Spmin⁡(NSˉ),S_p^{\min}(\mathrm{N}_R\otimes\mathrm{N}_{\bar S}) < S_p^{\min}(\mathrm{N}_R)+S_p^{\min}(\mathrm{N}_{\bar S}),Spmin​(NR​⊗NSˉ​)<Spmin​(NR​)+Spmin​(NSˉ​), for every real order 0<p≤1/220<p\le 1/220<p≤1/22. Every step of the verification reduces to comparisons of integers, and the complete certificate is a few small rational matrices that a reader can check with a short program -- or, for any single order, by hand. To our knowledge, consistent with the assessment of Leung, Lovitz, and Wu, this is the first printed, computer-verifiable certified positive-order endpoint for this explicit pair. We claim no novelty for the phenomenon or for the eigenvalue-floor mechanism, both due to CHLMW, and no optimality of the endpoint.
For bipartite pure and mixed quantum states, in addition to the quantum mutual information, there is another measure of total correlation, namely, the entanglement of purification. We study the monogamy, polygamy, and additivity properties of the entanglement of purification for pure and mixed states. In this paper, we show that, in contrast to the quantum mutual information which is strictly monogamous for any tripartite pure states, the entanglement of purification is polygamous for the same. This shows that there can be genuinely two types of total correlation across any bipartite cross in a pure tripartite state. Furthermore, we find the lower bound and actual values of the entanglement of purification for different classes of tripartite and higher-dimensional bipartite mixed states. Thereafter, we show that if entanglement of purification is not additive on tensor product states, it is actually subadditive. Using these results, we identify some states which are additive on tensor products for entanglement of purification. The implications of these findings on the quantum advantage of dense coding are briefly discussed, whereby we show that for tripartite pure states, it is strictly monogamous and if it is nonadditive, then it is superadditive on tensor product states.