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:1502.06411 · IEEE Transactions on Information Theory

Additive Bounds of Minimum Output Entropies for Unital Channels and an Exact Qubit Formula

Motohisa Fukuda, Gilad Gour

Published Dec 19, 2016• 7 citations
arXivHTMLPDF

Abstract

We find an upper bound for the minimum output entropy of a unital quantum channel, and obtain an exact formula for general qubit channels. Our techniques incorporate the Rényi entropies, particularly, with Rényi parameter α = 2. Moreover, since our upper bound is additive under tensor product, we get as a corollary an upper bound for the classical capacity of unital quantum channels. Interestingly, our upper bound for the classical capacity depends only on the operator norm of matrix representations of channels on the space of traceless Hermitian operators, and is tight in the sense that it gives the precise quantity of classical capacity of the Werner-Holevo channel. As an example, we study quantum channels with operator sum representation that is made of the discrete Weyl operators (generalized Pauli operators), and explain how our formula works in this case. Finally, we find new examples for which the minimum output Rényi 2-entropy is additive.

DOI
10.1109/tit.2016.2641455

Related papers

Additivity for unital qubit channels

Christopher King

Additivity of the Holevo capacity is proved for product channels, under the condition that one of the channels is a unital qubit channel, with the other completely arbitrary. As a byproduct this proves that the Holevo bound is the classical information capacity of such qubit channels, and provides an explicit formula for this classical capacity. Additivity of minimal entropy and multiplicativity of p-norms are also proved under the same assumptions. The proof relies on a new bound for the p-norm of an output state from the half-noisy phase-damping channel.

arXiv:quant-ph/0103156•Journal of Mathematical Physics•Sep 26, 2002•215 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

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

arXiv:quant-ph/0201149•Journal of Mathematical Physics•Sep 1, 2002•203 citations

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•8 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•8 citations
We find an upper bound for the minimum output entropy of a unital quantum channel, and obtain an exact formula for general qubit channels. Our techniques incorporate the Rényi entropies, particularly, with Rényi parameter α = 2. Moreover, since our upper bound is additive under tensor product, we get as a corollary an upper bound for the classical capacity of unital quantum channels. Interestingly, our upper bound for the classical capacity depends only on the operator norm of matrix representations of channels on the space of traceless Hermitian operators, and is tight in the sense that it gives the precise quantity of classical capacity of the Werner-Holevo channel. As an example, we study quantum channels with operator sum representation that is made of the discrete Weyl operators (generalized Pauli operators), and explain how our formula works in this case. Finally, we find new examples for which the minimum output Rényi 2-entropy is additive.
Additivity of the Holevo capacity is proved for product channels, under the condition that one of the channels is a unital qubit channel, with the other completely arbitrary. As a byproduct this proves that the Holevo bound is the classical information capacity of such qubit channels, and provides an explicit formula for this classical capacity. Additivity of minimal entropy and multiplicativity of p-norms are also proved under the same assumptions. The proof relies on a new bound for the p-norm of an output state from the half-noisy phase-damping channel.
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) − ∑
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.
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 .
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.