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

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

Shokoufe Faraji, Zahra Baghali Khanian

quant-phcs.ITSubmitted May 14, 2026• Announced May 18, 2026• 4 citations
arXivHTMLPDF

Abstract

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.

Related papers

Notes on multiplicativity of maximal output purity for completely positive qubit maps

K M R Audenaert

A problem in quantum information theory that has received considerable attention in recent years is the question of multiplicativity of the so-called maximal output purity (MOP) of a quantum channel. This quantity is defined as the maximum value of the purity one can get at the output of a channel by varying over all physical input states, when purity is measured by the Schatten $q$-norm, and is denoted by $ν_q$. The multiplicativity problem is the question whether two channels used in parallel have a combined $ν_q$ that is the product of the $ν_q$ of the two channels. A positive answer would imply a number of other additivity results in QIT. Very recently, P. Hayden has found counterexamples for every value of $q>1$. Nevertheless, these counterexamples require that the dimension of these channels increases with $1-q$ and therefore do not rule out multiplicativity for $q$ in intervals $[1,q_0)$ with $q_0$ depending on the channel dimension. I argue that this would be enough to prove additivity of entanglement of formation and of the classical capacity of quantum channels. More importantly, no counterexamples have as yet been found in the important special case where one of the channels is a qubit-channel, i.e. its input states are 2-dimensional. In this paper I focus attention to this qubit case and I rephrase the multiplicativity conjecture in the language of block matrices and prove the conjecture in a number of special cases.

arXiv:0709.0855•Journal of Physics Conference Series•Mar 1, 2008•1 citation

Completely Bounded Qusi-Norms, Their Mutiplicativity, and New Additivity Results of Quantum Channels

Ke Li, Quanhua Xu

We obtain two new additivity results of quantum channels. The first one is the additivity of the channel Rényi information associated with the sandwiched Rényi divergence of order $α\in[\frac{1}{2},1)$. To prove this, we introduce the completely bounded $1\toα$ quasi-norms for completely positive maps, with $α\in[\frac{1}{2},1)$, and show that it is multiplicative. The additivity/multiplicativity derived here extends and complements the results of Devetak {\it et al} (Commun Math Phys 266:37-63, 2006) and Gupta and Wilde (Commun Math Phys 334:867-887, 2015), which deal with the case $α>1$. The second one is the additivity of the channel dispersion, which is a quantity related to the second-order behavior of quantum information tasks.

quant-pharXiv:2603.16722•Mar 18, 2026•1 citation

Additivity and Chain Rules for Quantum Entropies via Multi-index Schatten Norms

Omar Fawzi, Jan Kochanowski, Cambyse Rouzé +1 more

The primary entropic measures for quantum states are additive under the tensor product. In the analysis of quantum information processing tasks, the minimum entropy of a set of states, e.g., the minimum output entropy of a channel, often plays a crucial role. A fundamental question in quantum information and cryptography is whether the minimum output entropy remains additive under the tensor product of channels. Here, we establish a general additivity statement for the optimized sandwiched Rényi entropy of quantum channels. For that, we generalize the results of Devetak et al. (Commun Math Phys 266(1):37-63, 2006) to multi-index Schatten norms. As an application, we strengthen the additivity statement of Van Himbeeck and Brown (A tight and general finite-size security proof for quantum key distribution, 2025) thus allowing the analysis of time-adaptive quantum cryptographic protocols. In addition, we establish chain rules for Rényi conditional entropies that are similar to the ones used for the generalized entropy accumulation theorem of Metger et al. (Commun Math Phys 405(11):261, 2024).

arXiv:2502.01611•Communications in Mathematical Physics•Mar 9, 2026•10 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•1 citation

Multi-Indexed Schatten Quasi- and Anti-Norms and Additivity of Conditional Rényi Entropies

Jan Kochanowski

We introduce and study multi-indexed Schatten spaces which lift the commutative $\ell_{q_1}\![\ell_{q_2}\![\ell_{q_3}\![\dots]]]$ -spaces to the quantum toolbox. They extend Pisier's operator-valued Schatten norms and the recently introduced two-indexed Schatten quasi-norms. For every ordered tuple $\mathcal{Q}=(q_1,\dots,q_n)$ of non-zero indices we define a quasi-norm (for positive indices) or an anti-norm (for negative indices) on operators on an $n$-fold tensor product of Hilbert spaces. We do this for indices of the same sign satisfying the mutual compatibility condition $|\frac{1}{q_i}-\frac{1}{q_j}|\leq1$. Beyond establishing desirable properties of these quasi- and anti-norms via factorization formulas that combine operator space and matrix-analytic techniques, we lift several central tools and results of the seminal [Devetak, Junge, King, Ruskai, CMP 2006] to the multi-indexed and quasi-normed setting. These include a general non-commutative Minkowski inequality relating swapped systems and two identity-removal equalities. As a consequence, complete hypercontractivity and complete reverse hypercontractivity tensorize for all compatible indices, including negative ones. Concerning quantum information theory we prove that the completely bounded minimal and the maximal output conditional entropies are additive under tensor products of quantum channels for all $α\geq\frac12$. This extends the case $α>1$ of [Fawzi, Kochanowski, Rouzé, Van Himbeeck, CMP 2026] and the unconditional results of [Devetak, Junge, King, Ruskai, CMP 2006]. Beyond tensor products, we establish chain rules for $\tilde H^\uparrow_α$, $α\in[\frac12,1)$, for compositions of possibly signaling channels, extending upon the smooth max-entropy chain rule used in device-independent entanglement certification to the whole interval $α\in[1/2,1)$.

quant-pharXiv:2610.04023•Oct 6, 2026•0 citations

Additivity of the Renyi entropy of order 2 for positive-partial-transpose-inducing channels

B. Dierckx, M. Fannes, Caroline Vandenplas

We prove that the minimal Renyi entropy of order 2 (RE2) output of a positive-partial-transpose (PPT)-inducing channel joint to an arbitrary other channel is equal to the sum of the minimal RE2 output of the individual channels. PPT-inducing channels are channels with a Choi matrix which is bound entangled or separable. The techniques used can be easily recycled to prove additivity for some non-PPT-inducing channels such as the depolarizing and transpose depolarizing channels, though not all known additive channels. We explicitly make the calculations for generalized Werner-Holevo channels as an example of both the scope and limitations of our techniques.

arXiv:0803.0479•Physical Review A•Jun 3, 2008•0 citations
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.
A problem in quantum information theory that has received considerable attention in recent years is the question of multiplicativity of the so-called maximal output purity (MOP) of a quantum channel. This quantity is defined as the maximum value of the purity one can get at the output of a channel by varying over all physical input states, when purity is measured by the Schatten qqq-norm, and is denoted by νqν_qνq​. The multiplicativity problem is the question whether two channels used in parallel have a combined νqν_qνq​ that is the product of the νqν_qνq​ of the two channels. A positive answer would imply a number of other additivity results in QIT. Very recently, P. Hayden has found counterexamples for every value of q>1q>1q>1. Nevertheless, these counterexamples require that the dimension of these channels increases with 1−q1-q1−q and therefore do not rule out multiplicativity for qqq in intervals [1,q0)[1,q_0)[1,q0​) with q0q_0q0​ depending on the channel dimension. I argue that this would be enough to prove additivity of entanglement of formation and of the classical capacity of quantum channels. More importantly, no counterexamples have as yet been found in the important special case where one of the channels is a qubit-channel, i.e. its input states are 2-dimensional. In this paper I focus attention to this qubit case and I rephrase the multiplicativity conjecture in the language of block matrices and prove the conjecture in a number of special cases.
We obtain two new additivity results of quantum channels. The first one is the additivity of the channel Rényi information associated with the sandwiched Rényi divergence of order α∈[12,1)α\in[\frac{1}{2},1)α∈[21​,1). To prove this, we introduce the completely bounded 1→α1\toα1→α quasi-norms for completely positive maps, with α∈[12,1)α\in[\frac{1}{2},1)α∈[21​,1), and show that it is multiplicative. The additivity/multiplicativity derived here extends and complements the results of Devetak {\it et al} (Commun Math Phys 266:37-63, 2006) and Gupta and Wilde (Commun Math Phys 334:867-887, 2015), which deal with the case α>1α>1α>1. The second one is the additivity of the channel dispersion, which is a quantity related to the second-order behavior of quantum information tasks.
The primary entropic measures for quantum states are additive under the tensor product. In the analysis of quantum information processing tasks, the minimum entropy of a set of states, e.g., the minimum output entropy of a channel, often plays a crucial role. A fundamental question in quantum information and cryptography is whether the minimum output entropy remains additive under the tensor product of channels. Here, we establish a general additivity statement for the optimized sandwiched Rényi entropy of quantum channels. For that, we generalize the results of Devetak et al. (Commun Math Phys 266(1):37-63, 2006) to multi-index Schatten norms. As an application, we strengthen the additivity statement of Van Himbeeck and Brown (A tight and general finite-size security proof for quantum key distribution, 2025) thus allowing the analysis of time-adaptive quantum cryptographic protocols. In addition, we establish chain rules for Rényi conditional entropies that are similar to the ones used for the generalized entropy accumulation theorem of Metger et al. (Commun Math Phys 405(11):261, 2024).
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 introduce and study multi-indexed Schatten spaces which lift the commutative ℓq1 ⁣[ℓq2 ⁣[ℓq3 ⁣[… ]]]\ell_{q_1}\![\ell_{q_2}\![\ell_{q_3}\![\dots]]]ℓq1​​[ℓq2​​[ℓq3​​[…]]] -spaces to the quantum toolbox. They extend Pisier's operator-valued Schatten norms and the recently introduced two-indexed Schatten quasi-norms. For every ordered tuple Q=(q1,…,qn)\mathcal{Q}=(q_1,\dots,q_n)Q=(q1​,…,qn​) of non-zero indices we define a quasi-norm (for positive indices) or an anti-norm (for negative indices) on operators on an nnn-fold tensor product of Hilbert spaces. We do this for indices of the same sign satisfying the mutual compatibility condition ∣1qi−1qj∣≤1|\frac{1}{q_i}-\frac{1}{q_j}|\leq1∣qi​1​−qj​1​∣≤1. Beyond establishing desirable properties of these quasi- and anti-norms via factorization formulas that combine operator space and matrix-analytic techniques, we lift several central tools and results of the seminal [Devetak, Junge, King, Ruskai, CMP 2006] to the multi-indexed and quasi-normed setting. These include a general non-commutative Minkowski inequality relating swapped systems and two identity-removal equalities. As a consequence, complete hypercontractivity and complete reverse hypercontractivity tensorize for all compatible indices, including negative ones. Concerning quantum information theory we prove that the completely bounded minimal and the maximal output conditional entropies are additive under tensor products of quantum channels for all α≥12α\geq\frac12α≥21​. This extends the case α>1α>1α>1 of [Fawzi, Kochanowski, Rouzé, Van Himbeeck, CMP 2026] and the unconditional results of [Devetak, Junge, King, Ruskai, CMP 2006]. Beyond tensor products, we establish chain rules for H~α↑\tilde H^\uparrow_αH~α↑​, α∈[12,1)α\in[\frac12,1)α∈[21​,1), for compositions of possibly signaling channels, extending upon the smooth max-entropy chain rule used in device-independent entanglement certification to the whole interval α∈[1/2,1)α\in[1/2,1)α∈[1/2,1).
We prove that the minimal Renyi entropy of order 2 (RE2) output of a positive-partial-transpose (PPT)-inducing channel joint to an arbitrary other channel is equal to the sum of the minimal RE2 output of the individual channels. PPT-inducing channels are channels with a Choi matrix which is bound entangled or separable. The techniques used can be easily recycled to prove additivity for some non-PPT-inducing channels such as the depolarizing and transpose depolarizing channels, though not all known additive channels. We explicitly make the calculations for generalized Werner-Holevo channels as an example of both the scope and limitations of our techniques.