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:0803.0479 · Physical Review A

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

B. Dierckx, M. Fannes, Caroline Vandenplas

Published Jun 3, 2008• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.77.060302

Related papers

Additivity rates and PPT property for random quantum channels

Motohisa Fukuda, Ion Nechita

Inspired by Montanaro’s work, we introduce the concept of additivity rates of a quantum channel L , which give the first order (linear) term of the minimum output p -Rényi entropies of L ⊗ r as functions of r . We lower bound the additivity rates of arbitrary quantum channels using the operator norms of several interesting matrices including partially transposed Choi matrices. As a direct consequence, we obtain upper bounds for the classical capacity of the channels. We study these matrices for random quantum channels defined by random subspaces of a bipartite tensor product space. A detailed spectral analysis of the relevant random matrix models is performed, and strong convergence towards free probabilistic limits is shown. As a corollary, we compute the threshold for random quantum channels to have the positive partial transpose (PPT) property. We then show that a class of random PPT channels violate generically additivity of the p -Rényi entropy for all p ≥ 30 . 95 .

arXiv:1411.6881•Annales mathématiques Blaise Pascal•Jan 1, 2015•7 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

Note on Multiple Additivity of Minimal Renyi Entropy Output of the Werner-Holevo Channels

Robert Alicki, M. Fannes

We give an elementary self-contained proof that the minimal Renyi entropy output of arbitrary products of channels [Formula: see text] is additive.

arXiv:quant-ph/0407033•Open Systems & Information Dynamics•Dec 1, 2004•35 citations

Entropic characterization of quantum operations

Wojciech Roga, M. Fannes, Karol Życzkowski

We investigate decoherence induced by a quantum channel in terms of minimal output entropy and of map entropy. The latter is the von Neumann entropy of the Jamiolkowski state of the channel. Both quantities admit q-Renyi versions. We prove additivity of the map entropy for all q. For the case q = 2, we show that the depolarizing channel has the smallest map entropy among all channels with a given minimal output Renyi entropy of order two. This allows us to characterize pairs of channels such that the output entropy of their tensor product acting on a maximally entangled input state is larger than the sum of the minimal output entropies of the individual channels. We conjecture that for any channel Φ1 acting on a finite dimensional system there exists a class of channels Φ2 sufficiently close to a unitary map such that additivity of minimal output entropy for Ψ1 x Ψ2 holds.

arXiv:1101.4105•Jan 21, 2011•1 citation

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

ENTROPIC CHARACTERIZATION OF QUANTUM OPERATIONS

Wojciech Roga, Karol Życzkowski, M. Fannes

We investigate decoherence induced by a quantum channel in terms of minimal output entropy and map entropy. The latter is the von Neumann entropy of the Jamiołkowski state of the channel. Both quantities admit q-Renyi versions. We prove additivity of the map entropy for all q. For the case q = 2, we show that the depolarizing channel has the smallest map entropy among all channels with a given minimal output Renyi entropy of order two. This allows us to characterize pairs of channels such that the output entropy of their tensor product acting on a maximally entangled input state is larger than the sum of the minimal output entropies of the individual channels. We conjecture that for any channel Φ1acting on a finite dimensional system, there exists a class of channels Φ2sufficiently close to a unitary map such that additivity of minimal output entropy for Ψ1⊗ Ψ2holds.

International Journal of Quantum Information•Jun 1, 2011•27 citations
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.
Inspired by Montanaro’s work, we introduce the concept of additivity rates of a quantum channel L , which give the first order (linear) term of the minimum output p -Rényi entropies of L ⊗ r as functions of r . We lower bound the additivity rates of arbitrary quantum channels using the operator norms of several interesting matrices including partially transposed Choi matrices. As a direct consequence, we obtain upper bounds for the classical capacity of the channels. We study these matrices for random quantum channels defined by random subspaces of a bipartite tensor product space. A detailed spectral analysis of the relevant random matrix models is performed, and strong convergence towards free probabilistic limits is shown. As a corollary, we compute the threshold for random quantum channels to have the positive partial transpose (PPT) property. We then show that a class of random PPT channels violate generically additivity of the p -Rényi entropy for all p ≥ 30 . 95 .
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.
We investigate decoherence induced by a quantum channel in terms of minimal output entropy and of map entropy. The latter is the von Neumann entropy of the Jamiolkowski state of the channel. Both quantities admit q-Renyi versions. We prove additivity of the map entropy for all q. For the case q = 2, we show that the depolarizing channel has the smallest map entropy among all channels with a given minimal output Renyi entropy of order two. This allows us to characterize pairs of channels such that the output entropy of their tensor product acting on a maximally entangled input state is larger than the sum of the minimal output entropies of the individual channels. We conjecture that for any channel Φ1 acting on a finite dimensional system there exists a class of channels Φ2 sufficiently close to a unitary map such that additivity of minimal output entropy for Ψ1 x Ψ2 holds.
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 investigate decoherence induced by a quantum channel in terms of minimal output entropy and map entropy. The latter is the von Neumann entropy of the Jamiołkowski state of the channel. Both quantities admit q-Renyi versions. We prove additivity of the map entropy for all q. For the case q = 2, we show that the depolarizing channel has the smallest map entropy among all channels with a given minimal output Renyi entropy of order two. This allows us to characterize pairs of channels such that the output entropy of their tensor product acting on a maximally entangled input state is larger than the sum of the minimal output entropies of the individual channels. We conjecture that for any channel Φ1acting on a finite dimensional system, there exists a class of channels Φ2sufficiently close to a unitary map such that additivity of minimal output entropy for Ψ1⊗ Ψ2holds.