Approaches for approximate additivity of the Holevo information of quantum channels

Felix Leditzky, Eneet Kaur, Nilanjana Datta, Mark M. Wilde

Research output: Contribution to journalArticlepeer-review


We study quantum channels that are close to another channel with weakly additive Holevo information, and we derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking channels, unital qubit channels, and Hadamard channels. Related to the method of approximate degradability, we define approximation parameters for each class above, which measure how close an arbitrary channel is to satisfying the respective property. This gives us upper bounds on the classical capacity in terms of functions of the approximation parameters, as well as an outer bound on the dynamic capacity region of a quantum channel. Since these parameters are defined in terms of the diamond distance, the upper bounds can be computed efficiently using semidefinite programming (SDP). We exhibit the usefulness of our method with two example channels: a convex mixture of amplitude damping and depolarizing noise and a composition of amplitude damping and dephasing noise. For both channels, our bounds perform well in certain regimes of the noise parameters in comparison to a recently derived SDP upper bound on the classical capacity. Along the way, we define the notion of a generalized channel divergence (which includes the diamond distance as an example), and we prove that for jointly covariant channels these quantities are maximized by purifications of a state invariant under the covariance group. This latter result may be of independent interest.

Original languageEnglish (US)
Article number012332
JournalPhysical Review A
Issue number1
StatePublished - Jan 25 2018
Externally publishedYes

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics


Dive into the research topics of 'Approaches for approximate additivity of the Holevo information of quantum channels'. Together they form a unique fingerprint.

Cite this