Additivity of Quantum Capacities in Simple Non-Degradable Quantum Channels

Quantum channel capacities give the fundamental performance limits for information flow over a communication channel. However, the prevalence of superadditivity is a major obstacle to understanding capacities, both quantitatively and conceptually. In contrast, examples exhibiting additivity, though relatively rare, offer crucial insights into the origins of nonadditivity and form the basis of our strongest upper bounds on capacity. Degradable channels, whose coherent information is provably additive, stand out as among the few classes of channels for which the quantum capacity is exactly computable. In this paper, we introduce two families of non-degradable channels whose coherent information remains additive, making their quantum capacities tractable. First, we demonstrate that channels capable of “outperforming” their environment, under conditions weaker than degradability, can exhibit either strong or weak additivity of coherent information. Second, we explore a complementary construction that modifies a channel to preserve coherent information additivity while destroying the “outperforming” property. We analyze how structural constraints guarantee strong and weak additivity and investigate how relaxing these constraints leads to the failure of strong additivity, with weak additivity potentially persisting.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Information Theory
Published
2025-06-27
DOI
https://doi.org/10.1109/tit.2025.3583936
Citations
1
Primary Topic
Quantum and electron transport phenomena
Type
article
Field-Weighted Citation Impact
1.25

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Additivity of Quantum Capacities in Simple Non-Degradable Quantum Channels

Peixue Wu, Graeme N. Smith
1 citations
IEEE Transactions on Information Theory
Quantum and electron transport phenomena
1.25
article

Additivity of Quantum Capacities in Simple Non-Degradable Quantum Channels

Peixue Wu, Graeme N. Smith
article en
1 citations

Abstract

Quantum channel capacities give the fundamental performance limits for information flow over a communication channel. However, the prevalence of superadditivity is a major obstacle to understanding capacities, both quantitatively and conceptually. In contrast, examples exhibiting additivity, though relatively rare, offer crucial insights into the origins of nonadditivity and form the basis of our strongest upper bounds on capacity. Degradable channels, whose coherent information is provably additive, stand out as among the few classes of channels for which the quantum capacity is exactly computable. In this paper, we introduce two families of non-degradable channels whose coherent information remains additive, making their quantum capacities tractable. First, we demonstrate that channels capable of “outperforming” their environment, under conditions weaker than degradability, can exhibit either strong or weak additivity of coherent information. Second, we explore a complementary construction that modifies a channel to preserve coherent information additivity while destroying the “outperforming” property. We analyze how structural constraints guarantee strong and weak additivity and investigate how relaxing these constraints leads to the failure of strong additivity, with weak additivity potentially persisting.

IEEE Transactions on Information TheoryVol. 71(8)
University of Waterloo (CA)
Canada First Research Excellence Fund
Affordable and clean energy
Openalex Percentile: Top 20%
Quantum and electron transport phenomena
1.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.