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.28897

Rényi Entanglement of Purification Is Non-additive

Amir-Reza Negari, Zahra Baghali Khanian

quant-phcs.ITSubmitted Aug 28, 2026• Announced Sep 1, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

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

The entanglement of purification is not additive

Artus Krohn-Grimberghe

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.

quant-pharXiv:2609.29539•Aug 26, 2026•0 citations

Counterexamples to additivity of minimum output $p$-Rényi entropy of quantum channels for all $p\ge 0$

Debbie Leung, Benjamin Lovitz, Ion Nechita +1 more

The additivity of minimum output entropies is a central problem in quantum information theory. Nonadditivity is known for every Rényi order $p>1$, at the von Neumann point $p=1$, and for sufficiently small positive $p$, while much of the interval $0<p<1$ has remained open. In this work, we prove that for every $p>0$ there exist finite-dimensional quantum channels whose minimum output $p$-Rényi entropies violate additivity. Our proof combines two constructions: random projection-induced channels yield nonadditivity for $p>3/4$, and antisymmetric postprocessing extends the violation to all positive Rényi orders. Our estimates also improve the output-dimension bound obtained by Belinschi, Collins, and Nechita for additivity violation of minimum output von Neumann entropy.

quant-pharXiv:2607.15210•Jul 17, 2026•0 citations

Almost One Bit Violation of Minimum-Output Rényi Entropy Additivity Simultaneously at All Orders

Guocheng Zhen, Chengkai Zhu, Ranyiliu Chen +1 more

We prove that minimum-output Rényi-entropy additivity can fail by almost one bit simultaneously at every nonnegative order. For every $\varepsilon\in(0,\log2)$, there exists a finite-dimensional quantum channel with a real Stinespring isometry such that the same maximally entangled input witnesses a tensor-square entropy gap of at least $\log2-\varepsilon$ for all $p\in[0,\infty]$. The output dimension can be chosen to be $O(\varepsilon^{-3})$ as $\varepsilon\downarrow0$. The construction uses direct products of free groups: tensorized Haagerup estimates control the one-copy outputs, while commutation between distinct factors forces exact Bell-branch collisions at two copies. Strong convergence gives both an existential realization through finite-dimensional representations of right-angled Artin groups followed by realification, and a Haar-orthogonal model whose success probability tends to one as the matrix dimension grows. We also determine the exact Bell quotient, prove asymptotically sharp regular-radius bounds, and show that the cubic output-dimension scale is optimal within the present purity--rank certificate.

quant-pharXiv:2609.18747•Sep 17, 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

Nonadditivity in fermionic quantum Shannon theory

Farzin Salek, Amir-Reza Negari, Graeme Smith +2 more

We study collective state preparation and channel encoding in fermionic systems under parity superselection and composition governed by the canonical anticommutation relations. For a two-mode Gaussian state $τ$, we obtain the exact entanglement of formation, $E_{\mathrm F}^{\mathrm{phys}}(τ^{\otimes m})=\lceil m/2\rceil\log2$ for every $m\geq1$. Two copies have the same formation value as one, violating additivity and strong superadditivity, while regularization halves the single-copy value. For an associated Gaussian channel, we determine the minimum output entropy and Holevo information at every blocklength and prove nonadditivity of both. Together, these results give exact answers to the fermionic counterparts of the four additivity questions associated with Shor and Hastings. One physical use carries no classical information, whereas two uses transmit one bit perfectly. The unassisted classical and zero-error classical capacities both equal one half bit per mode. A sharp finite-block bound gives a strong converse: the decoding success probability vanishes at every rate above capacity. These optimizations cover all physical pure-state decompositions and channel inputs, with Gaussian ensembles and classical codes attaining the optima. The formation and minimum output entropy formulas hold for every Rényi order $α\in(0,\infty]$. We also determine the unassisted quantum and zero-error quantum capacities, both equal to one half logical qubit per mode, and prove a strong converse: entanglement fidelity vanishes at every rate above capacity. For a noisy Gaussian family, we determine the one- and two-copy formation values and prove strict nonadditivity at full rank. For $τ$, Bell violation under local parity-preserving measurements first appears at three copies.

quant-pharXiv:2610.06758•Oct 6, 2026•0 citations
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 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.
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.
Counterexamples to additivity of minimum output ppp-Rényi entropy of quantum channels for all p≥0p\ge 0p≥0
The additivity of minimum output entropies is a central problem in quantum information theory. Nonadditivity is known for every Rényi order p>1p>1p>1, at the von Neumann point p=1p=1p=1, and for sufficiently small positive ppp, while much of the interval 0<p<10<p<10<p<1 has remained open. In this work, we prove that for every p>0p>0p>0 there exist finite-dimensional quantum channels whose minimum output ppp-Rényi entropies violate additivity. Our proof combines two constructions: random projection-induced channels yield nonadditivity for p>3/4p>3/4p>3/4, and antisymmetric postprocessing extends the violation to all positive Rényi orders. Our estimates also improve the output-dimension bound obtained by Belinschi, Collins, and Nechita for additivity violation of minimum output von Neumann entropy.
We prove that minimum-output Rényi-entropy additivity can fail by almost one bit simultaneously at every nonnegative order. For every ε∈(0,log⁡2)\varepsilon\in(0,\log2)ε∈(0,log2), there exists a finite-dimensional quantum channel with a real Stinespring isometry such that the same maximally entangled input witnesses a tensor-square entropy gap of at least log⁡2−ε\log2-\varepsilonlog2−ε for all p∈[0,∞]p\in[0,\infty]p∈[0,∞]. The output dimension can be chosen to be O(ε−3)O(\varepsilon^{-3})O(ε−3) as ε↓0\varepsilon\downarrow0ε↓0. The construction uses direct products of free groups: tensorized Haagerup estimates control the one-copy outputs, while commutation between distinct factors forces exact Bell-branch collisions at two copies. Strong convergence gives both an existential realization through finite-dimensional representations of right-angled Artin groups followed by realification, and a Haar-orthogonal model whose success probability tends to one as the matrix dimension grows. We also determine the exact Bell quotient, prove asymptotically sharp regular-radius bounds, and show that the cubic output-dimension scale is optimal within the present purity--rank certificate.
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.
We study collective state preparation and channel encoding in fermionic systems under parity superselection and composition governed by the canonical anticommutation relations. For a two-mode Gaussian state τττ, we obtain the exact entanglement of formation, EFphys(τ⊗m)=⌈m/2⌉log⁡2E_{\mathrm F}^{\mathrm{phys}}(τ^{\otimes m})=\lceil m/2\rceil\log2EFphys​(τ⊗m)=⌈m/2⌉log2 for every m≥1m\geq1m≥1. Two copies have the same formation value as one, violating additivity and strong superadditivity, while regularization halves the single-copy value. For an associated Gaussian channel, we determine the minimum output entropy and Holevo information at every blocklength and prove nonadditivity of both. Together, these results give exact answers to the fermionic counterparts of the four additivity questions associated with Shor and Hastings. One physical use carries no classical information, whereas two uses transmit one bit perfectly. The unassisted classical and zero-error classical capacities both equal one half bit per mode. A sharp finite-block bound gives a strong converse: the decoding success probability vanishes at every rate above capacity. These optimizations cover all physical pure-state decompositions and channel inputs, with Gaussian ensembles and classical codes attaining the optima. The formation and minimum output entropy formulas hold for every Rényi order α∈(0,∞]α\in(0,\infty]α∈(0,∞]. We also determine the unassisted quantum and zero-error quantum capacities, both equal to one half logical qubit per mode, and prove a strong converse: entanglement fidelity vanishes at every rate above capacity. For a noisy Gaussian family, we determine the one- and two-copy formation values and prove strict nonadditivity at full rank. For τττ, Bell violation under local parity-preserving measurements first appears at three copies.