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:1310.5990 · Quantum Information and Computation

Multiplicativity of superoperator norms for some entanglement breaking channels

Christopher King

Published Oct 1, 2014• 2 citations
arXivHTMLPDF

Abstract

It is known that the minimal output entropy is additive for any product of entanglement breaking (EB) channels. The same is true for the Renyi entropy, where additivity is equivalent to multiplicativity of the \norm{1}{q} norm for all $q \ge 1$. In this paper we consider the related question of multiplicativity of the \norm{2}{q} norm for $q > 2$ for entanglement breaking channels. We prove that multiplicativity holds in this case for certain classes of EB channels, including both the CQ and QC channels.

DOI
10.26421/qic14.13-14-10

Related papers

The maximal p-norm multiplicativity conjecture is false

Patrick M. Hayden

For all 1 < p < 2, we demonstrate the existence of quantum channels with non-multiplicative maximal p-norms. Equivalently, the minimum output Renyi entropy of order p of a quantum channel is not additive for all 1 < p < 2. The violations found are large. As p approaches 1, the minimum output Renyi entropy of order p for a product channel need not be significantly greater than the minimum output entropy of its individual factors. Since p=1 corresponds to the von Neumann entropy, these counterexamples demonstrate that if the additivity conjecture of quantum information theory is true, it cannot be proved as a consequence of maximal p-norm multiplicativity.

arXiv:0707.3291•Jul 23, 2007•33 citations

Maximal p-norms of entanglement breaking channels

Christopher King

It shown that when one of the components of a product channel is entanglement breaking, the output state with maximal p-norm is always a product state. This result complements Shor's theorem that both minimal entropy and Holevo capacity are additive for entanglement breaking channels. It is also shown how Shor's results can be recovered from the p-norm results by considering their behavior for p close to one.

arXiv:quant-ph/0212057•Quantum Information and Computation•Mar 1, 2003•70 citations

Classical information capacity of a class of quantum channels

M M Wolf, Jens Eisert

We consider the additivity of the minimal output entropy and the classical information capacity of a class of quantum channels. For this class of channels, the norm of the output is maximized for the output being a normalized projection. We prove the additivity of the minimal output Renyi entropies with entropic parameters α ∊ [0, 2], generalizing an argument by Alicki and Fannes, and present a number of examples in detail. In order to relate these results to the classical information capacity, we introduce a weak form of covariance of a channel. We then identify various instances of weakly covariant channels for which we can infer the additivity of the classical information capacity. Both additivity results apply to the case of an arbitrary number of different channels. Finally, we relate the obtained results to instances of bi-partite quantum states for which the entanglement cost can be calculated.

arXiv:quant-ph/0412133•New Journal of Physics•Apr 12, 2005•48 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•4 citations

Additivity of the Classical Capacity of Entanglement-Breaking Quantum Channels

Peter W. Shor

We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (for minimum entropy output) or superadditivity (for classical capacity) that can occur. One of the more important open questions of quantum information theory is the determination of the capacity of a quantum channel for carrying classical information. This question has been only partially resolved. If entanglement between multiple inputs to the channel is not allowed, a formula for the classical capacity of a quantum channel has indeed been discovered [1, 2]. This capacity formula for a quantum channel Ψ is χ ∗ (Ψ) = max p i,ρ i H Ψ(piρi) − ∑

•Jan 31, 2002•171 citations

Some new additivity results on quantum channels

Motohisa Fukuda

In this paper we introduce a lemma. This lemma states that for a unitary covariant channel $\\Psi$ and a channel $M$ such that $M(\\rho_0)$ is of rank one for some state $\\rho_0$ the additivity of the minimal output entropy of $\\Psi$ implies that of $\\Psi \\circ M$, and the multiplicativity of the maximal output $p$-norm of $\\Psi$, that of $\\Psi \\circ M$. Applying the lemma to the depolarising channel we produce a new class of memoryless quantum channels for which the additivity of the minimal output entropy and the multiplicativity of the maximal output $p$-norm hold. This class includes the shifted depolarising channel.

•May 4, 2005•1 citation
It is known that the minimal output entropy is additive for any product of entanglement breaking (EB) channels. The same is true for the Renyi entropy, where additivity is equivalent to multiplicativity of the \norm{1}{q} norm for all q≥1q \ge 1q≥1. In this paper we consider the related question of multiplicativity of the \norm{2}{q} norm for q>2q > 2q>2 for entanglement breaking channels. We prove that multiplicativity holds in this case for certain classes of EB channels, including both the CQ and QC channels.
For all 1 < p < 2, we demonstrate the existence of quantum channels with non-multiplicative maximal p-norms. Equivalently, the minimum output Renyi entropy of order p of a quantum channel is not additive for all 1 < p < 2. The violations found are large. As p approaches 1, the minimum output Renyi entropy of order p for a product channel need not be significantly greater than the minimum output entropy of its individual factors. Since p=1 corresponds to the von Neumann entropy, these counterexamples demonstrate that if the additivity conjecture of quantum information theory is true, it cannot be proved as a consequence of maximal p-norm multiplicativity.
We consider the additivity of the minimal output entropy and the classical information capacity of a class of quantum channels. For this class of channels, the norm of the output is maximized for the output being a normalized projection. We prove the additivity of the minimal output Renyi entropies with entropic parameters α ∊ [0, 2], generalizing an argument by Alicki and Fannes, and present a number of examples in detail. In order to relate these results to the classical information capacity, we introduce a weak form of covariance of a channel. We then identify various instances of weakly covariant channels for which we can infer the additivity of the classical information capacity. Both additivity results apply to the case of an arbitrary number of different channels. Finally, we relate the obtained results to instances of bi-partite quantum states for which the entanglement cost can be calculated.
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 show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (for minimum entropy output) or superadditivity (for classical capacity) that can occur. One of the more important open questions of quantum information theory is the determination of the capacity of a quantum channel for carrying classical information. This question has been only partially resolved. If entanglement between multiple inputs to the channel is not allowed, a formula for the classical capacity of a quantum channel has indeed been discovered [1, 2]. This capacity formula for a quantum channel Ψ is χ ∗ (Ψ) = max p i,ρ i H Ψ(piρi) − ∑
In this paper we introduce a lemma. This lemma states that for a unitary covariant channel Psi\\PsiPsi and a channel MMM such that M(rho0)M(\\rho_0)M(rho0​) is of rank one for some state rho0\\rho_0rho0​ the additivity of the minimal output entropy of Psi\\PsiPsi implies that of PsicircM\\Psi \\circ MPsicircM, and the multiplicativity of the maximal output ppp-norm of Psi\\PsiPsi, that of PsicircM\\Psi \\circ MPsicircM. Applying the lemma to the depolarising channel we produce a new class of memoryless quantum channels for which the additivity of the minimal output entropy and the multiplicativity of the maximal output ppp-norm hold. This class includes the shifted depolarising channel.