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:1509.07294 · Journal of Mathematical Physics

Capacity bounds via operator space methods

Li Gao, Marius Junge, Nicholas D. LaRacuente

Published Dec 1, 2018• 15 citations
arXivHTMLPDF

Abstract

We prove that for generalized dephasing channels, the coherent information and reverse coherent information coincides. It also implies an alternative approach for the strong super-additivity and strong converse of generalized dephasing channels using the operator space technique. Our argument is based on an improved Rényi relative entropy estimate via analyzing the channel’s Stinespring space. We also apply this estimate to new examples of quantum channels arising from quantum group co-representation and Kitave’s quantum computation model. In particular, we find concrete examples of non-degradable channels that our estimates are tight and give a formula of nontrivial quantum capacity.

DOI
10.1063/1.5058692

Related papers

Additivity of Quantum Capacities in Simple Non-Degradable Quantum Channels

Graeme Smith, Peixue Wu

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.

arXiv:2409.03927•IEEE Transactions on Information Theory•Jun 27, 2025•4 citations

Additivity of Quantum Capacities in Simple Non-Degradable Quantum Channels

Graeme Smith, Peixue Wu

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. Examples of additivity, while rare, provide key insight into the origins of nonadditivity and enable our best upper bounds on capacities. Degradable channels, which have additive coherent information, are some of the only channels for which we can calculate the quantum capacity. 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 International Symposium on Information Theory (ISIT)•Jun 22, 2025•3 citations

Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels

Tulja Varun Kondra, Raphael Brinster, Hermann Kampermann +2 more

The quantum capacity of a noisy channel quantifies the maximum rate at which quantum information can be transmitted reliably. For general channels, its evaluation requires an optimization over arbitrarily many channel uses. Degradable channels form a central exception: their capacity is given by the single-letter coherent information, while antidegradable channels have zero capacity. Nevertheless, even for these fundamental classes, it has remained open whether communication above capacity becomes possible when a fixed non-maximal error is tolerated. Here we resolve this problem by proving an exponential strong converse for every finite-dimensional degradable and antidegradable channel: at any rate above capacity, the fidelity of every coding scheme decays exponentially with the number of channel uses. As an immediate consequence, we establish the first all-code exponential strong converse for the quantum erasure channel throughout its full parameter range, strengthening previous results that applied only to almost all codes. We also show that exponential strong-converse bounds are preserved under receiver post-processing. This yields efficiently computable semidefinite-programming bounds for arbitrary finite-dimensional channels, improved bounds for Pauli channels, and an exact exponential strong converse for a nondegradable multilevel amplitude-damping family.

quant-pharXiv:2608.01308•Aug 4, 2026•6 citations

Operator algebra approach to quantum capacities

Li Gao, Marius Junge, Nicholas D. LaRacuente

Using a suitable algebraic setup, we find new estimates of the quantum capacity and the potential quantum capacity for non-degradable channels obtained by random unitaries associated with a finite group. This approach can be generalized to quantum groups and uses new tools from operator algebras and interpolation of Rényi-type entropies. As an application, we obtain new estimates for the depolarizing channel in high dimension.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•0 citations

Strong Converse Bounds in Quantum Network Information Theory

Hao–Chung Cheng, Nilanjana Datta, Cambyse Rouzé

We develop the first method for finding strong converse bounds in quantum network information theory. The general scheme relies on a recently obtained result in the field of non-commutative functional inequalities, namely the tensorization property of quantum reverse hypercontractivity for the quantum depolarizing semigroup, and properties of the projectively measured Rényi relative entropies. We develop a novel technique to employ this result to find both finite blocklength and exponential strong converse bounds for the tasks of distributed quantum hypothesis testing with communication constraints for a classical-quantum state, quantum source coding with compressed classical side information, and classical-quantum degraded broadcast channel coding. A full version of this paper is accessible at: arXiv:1905.00873 and arXiv:1905.00874.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•4 citations

Enhanced quantum capacity thresholds from symmetry

Avantika Agarwal, Amolak Ratan Kalra, Sungjai Lee +4 more

The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum capacity of most channels is unknown, with wide gaps between the best upper and lower bounds. Even deciding whether a channel has nonzero capacity -- finding its capacity threshold -- is difficult. In this paper we report significant increases in the capacity thresholds of two prototypical noise models: the depolarizing channel and Pauli channels. In the case of the depolarizing channel, this is the first improvement in 18 years, giving a bigger increase beyond the hashing bound than all previous improvements combined. Our starting point is the representation theoretic framework recently proposed by Bhalerao and Leditzky (2025) to compute coherent information for special permutation invariant states. We generalize their framework to the full symmetric subspace, which allow us to optimize coherent information over rank two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space, corresponding to a massive decrease in environment entropy for states on the symmetric space compared to the maximally mixed state. This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes.

quant-pharXiv:2605.09138•May 12, 2026•5 citations
We prove that for generalized dephasing channels, the coherent information and reverse coherent information coincides. It also implies an alternative approach for the strong super-additivity and strong converse of generalized dephasing channels using the operator space technique. Our argument is based on an improved Rényi relative entropy estimate via analyzing the channel’s Stinespring space. We also apply this estimate to new examples of quantum channels arising from quantum group co-representation and Kitave’s quantum computation model. In particular, we find concrete examples of non-degradable channels that our estimates are tight and give a formula of nontrivial quantum capacity.
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.
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. Examples of additivity, while rare, provide key insight into the origins of nonadditivity and enable our best upper bounds on capacities. Degradable channels, which have additive coherent information, are some of the only channels for which we can calculate the quantum capacity. 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.
The quantum capacity of a noisy channel quantifies the maximum rate at which quantum information can be transmitted reliably. For general channels, its evaluation requires an optimization over arbitrarily many channel uses. Degradable channels form a central exception: their capacity is given by the single-letter coherent information, while antidegradable channels have zero capacity. Nevertheless, even for these fundamental classes, it has remained open whether communication above capacity becomes possible when a fixed non-maximal error is tolerated. Here we resolve this problem by proving an exponential strong converse for every finite-dimensional degradable and antidegradable channel: at any rate above capacity, the fidelity of every coding scheme decays exponentially with the number of channel uses. As an immediate consequence, we establish the first all-code exponential strong converse for the quantum erasure channel throughout its full parameter range, strengthening previous results that applied only to almost all codes. We also show that exponential strong-converse bounds are preserved under receiver post-processing. This yields efficiently computable semidefinite-programming bounds for arbitrary finite-dimensional channels, improved bounds for Pauli channels, and an exact exponential strong converse for a nondegradable multilevel amplitude-damping family.
We develop the first method for finding strong converse bounds in quantum network information theory. The general scheme relies on a recently obtained result in the field of non-commutative functional inequalities, namely the tensorization property of quantum reverse hypercontractivity for the quantum depolarizing semigroup, and properties of the projectively measured Rényi relative entropies. We develop a novel technique to employ this result to find both finite blocklength and exponential strong converse bounds for the tasks of distributed quantum hypothesis testing with communication constraints for a classical-quantum state, quantum source coding with compressed classical side information, and classical-quantum degraded broadcast channel coding. A full version of this paper is accessible at: arXiv:1905.00873 and arXiv:1905.00874.
The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum capacity of most channels is unknown, with wide gaps between the best upper and lower bounds. Even deciding whether a channel has nonzero capacity -- finding its capacity threshold -- is difficult. In this paper we report significant increases in the capacity thresholds of two prototypical noise models: the depolarizing channel and Pauli channels. In the case of the depolarizing channel, this is the first improvement in 18 years, giving a bigger increase beyond the hashing bound than all previous improvements combined. Our starting point is the representation theoretic framework recently proposed by Bhalerao and Leditzky (2025) to compute coherent information for special permutation invariant states. We generalize their framework to the full symmetric subspace, which allow us to optimize coherent information over rank two states in that space. A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space, corresponding to a massive decrease in environment entropy for states on the symmetric space compared to the maximally mixed state. This explains the enhanced coherent information as a manifestation of degeneracy for the resulting codes.