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:2608.01308

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

Tulja Varun Kondra, Raphael Brinster, Hermann Kampermann, Dagmar Bruß, Nikolai Wyderka

quant-phSubmitted Aug 2, 2026• Announced Aug 4, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Comments
10+7 pages, 2 figures

Related papers

An exponential strong converse for private communication over degradable quantum channels

Mark M. Wilde

We prove an exponential strong converse for the unassisted private capacity of every finite-dimensional degradable quantum channel. We use a single error criterion: the infidelity between the actual message-estimate-environment state and an ideal state consisting of uniformly distributed, perfectly correlated messages that are independent of the environment. At every rate strictly above the channel's maximum coherent information, the optimized fidelity to this ideal state decays exponentially in the number of channel uses. The same bound holds when the ideal environment state is fixed to the actual environment marginal. The proof applies to arbitrary mixed-state encoders and arbitrary collective decoders. Its main operator ingredient is an overlap bound for privacy tests: two receiver placements with a common subsystem of dimension $d_C$ have overlap at most $d_C/M$, where $M$ is the key size, independently of both shield dimensions. We combine this bound with the signed averaging construction presented in arXiv:2608.01308 and a single-filter reduction to symmetric states. A Gaussian filter replaces the common receiver subsystem by a system of controlled dimension from which the original correlations can be approximately recovered using quantum side information. The filter preserves exact exchange symmetry, and a uniform smooth-entropy estimate bounds its output dimension for arbitrary correlated channel inputs. We also obtain an exponential strong converse at zero for antidegradable channels under the same joint criterion and, consequently, for the private capacity of the quantum erasure channel throughout its parameter range.

quant-pharXiv:2609.32515•Sep 29, 2026•0 citations

Strong Converses for Quantum Channel Capacities from Blowing-Up Lemmata

Salman Beigi, Marco Tomamichel

A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary entangled inputs across channel uses and joint decoding. Above quantum or classical capacity, entanglement fidelity or decoding success probability, respectively, decays exponentially with the number of channel uses. Above private capacity, fidelity to an ideal shared secret key decays exponentially; in particular, vanishing secrecy error forces decoding success to vanish. The proofs combine one-shot quantum blowing-up lemmas, which convert codes with low success into reliable codes with a controlled loss in code size, with a low-degree polynomial approximation of the channel's Stinespring image projector. The loss is governed by the projective tensor norm of the approximation across the receiver--environment bipartition. For memoryless channels, the polynomial construction gives exponential accuracy while keeping the rate loss arbitrarily small, turning the corresponding weak converses into strong converses.

quant-pharXiv:2609.11771•Sep 11, 2026•0 citations

No information transmission through quantum channels above capacity

Hao-Chung Cheng, Marco Tomamichel

We show that the capacity of a quantum channel demarcates a phase transition: while reliable transmission below capacity is always possible, any attempt to transmit information above it fails catastrophically. Specifically, we prove exponential strong converse theorems for unassisted quantum and classical communication over arbitrary finite-dimensional memoryless quantum channels. At rates beyond the respective capacity, the entanglement-generation fidelity and the success probability for classical communication decay exponentially with the number of channel uses. This rules out transmission above capacity even when one tolerates arbitrarily large errors. Our proof follows the classical Arimoto strategy, augmented by a crucial new ingredient: integral representations of Rényi information measures that lead to asymptotic continuity bounds for Rényi capacities.

quant-pharXiv:2609.08998•Sep 9, 2026•0 citations

A strong converse for stabilizer codes over Pauli channels via the blowing-up lemma

Marco Tomamichel

We prove a strong converse for quantum communication over Pauli channels within the class of stabilizer codes. If a code whose code space is a full joint eigenspace of a stabilizer group transmits above the coherent information of its own input state, its entanglement fidelity decays exponentially in the block length; the encoder may be any isometry onto that space and the decoder any channel. For memoryless channels this determines the $\varepsilon$-quantum capacity of the class for every $\varepsilon < 1$, so that tolerating a constant error buys no rate; for antidegradable channels, such as the depolarizing channel with error probability $p \in [1/4, 3/4]$, that capacity is zero, while for $p \in [1/4,1/2)$ partial-transposition bounds provably cannot certify a strong converse. The proof uses neither additivity assumptions nor semidefinite relaxations: optimal decoding succeeds precisely on an event in a product probability space, so the blowing-up lemma of Ahlswede, Gács and Körner applies, and the side information it produces is charged against the coherent information. The argument also constrains near-deterministic decoding for codes of any kind, and we isolate the encoder-side statement that would extend it to all of them.

quant-pharXiv:2607.23450•Jul 28, 2026•0 citations

Quantum capacity analysis of finite-dimensional lossy channels

Sofia Cocciaretto, Vittorio Giovannetti

Traditionally, Quantum Information, and Quantum Communication specifically, have been focused on qubit-based architectures. Recent results, however, highlighted that higher dimensional architectures (qudit-based) may present advantages both in terms of communication and computation; a family of channels called Multi-level Amplitude Damping (MAD) channels, which are a possible qudit generalization of the well known Amplitude Damping Channels, is able to model energy decay processes that may happen during signal transmission. In this work, the Quantum Capacity of 4-dimensional MAD's is studied, relying on a technique for computing it even outside of degradable and antidegradable conditions. We also characterized the complete region of antidegradability and degradability in the parameter space for a generic d-dimensional MAD using both analytical and semi-numerical methods.

quant-pharXiv:2601.18960•Jan 28, 2026•0 citations

Exponential strong converse for blind quantum data compression

Kohdai Kuroiwa

We establish exponential strong converse theorems for blind quantum data compression of finite-dimensional mixed-state sources, with and without entanglement assistance. Blind compression is a fundamental quantum information processing task in which the sender aims to transmit quantum states without direct access to the classical label. Strong converse is a notable aspect of data compression: the accuracy of the compression abruptly drops down to zero once the compression rate goes below a threshold. Strong converses for data compression have been established for pure-state sources; however, for mixed-state sources, the optimal compression rate is determined by a structural decomposition of quantum states and can change substantially under small perturbations. This sensitivity makes it difficult to quantitatively analyze the trade-off between compression rate and error. Despite recent progress, whether a strong converse holds at the optimal rate has remained unresolved in general. In this work, we resolve this question affirmatively. For unassisted compression, we show that at every rate below the optimum, the accuracy decays exponentially with the block length for general mixed-state sources without restrictions on protocols. We also prove exponential strong converse for blind compression with unlimited entanglement assistance at its optimal rate. Combining the two strong converse bounds yields exponential decay at every compression-entanglement rate pair outside the complete achievable rate region. Our proof introduces a new overlap quantity based on the structure of quantum states; this quantity connects preservation of the source information to the dimension of the transmitted system. We expect that this approach provides useful tools for converse analyses of other quantum information-processing tasks involving mixed states.

quant-pharXiv:2609.38328•Oct 1, 2026•0 citations
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 prove an exponential strong converse for the unassisted private capacity of every finite-dimensional degradable quantum channel. We use a single error criterion: the infidelity between the actual message-estimate-environment state and an ideal state consisting of uniformly distributed, perfectly correlated messages that are independent of the environment. At every rate strictly above the channel's maximum coherent information, the optimized fidelity to this ideal state decays exponentially in the number of channel uses. The same bound holds when the ideal environment state is fixed to the actual environment marginal. The proof applies to arbitrary mixed-state encoders and arbitrary collective decoders. Its main operator ingredient is an overlap bound for privacy tests: two receiver placements with a common subsystem of dimension dCd_CdC​ have overlap at most dC/Md_C/MdC​/M, where MMM is the key size, independently of both shield dimensions. We combine this bound with the signed averaging construction presented in arXiv:2608.01308 and a single-filter reduction to symmetric states. A Gaussian filter replaces the common receiver subsystem by a system of controlled dimension from which the original correlations can be approximately recovered using quantum side information. The filter preserves exact exchange symmetry, and a uniform smooth-entropy estimate bounds its output dimension for arbitrary correlated channel inputs. We also obtain an exponential strong converse at zero for antidegradable channels under the same joint criterion and, consequently, for the private capacity of the quantum erasure channel throughout its parameter range.
A quantum channel can transmit quantum states, classical messages, or classical messages that remain secret from its environment. We prove exponential strong converses for all three tasks over arbitrary finite-dimensional memoryless quantum channels, at their respective regularized capacities and allowing arbitrary entangled inputs across channel uses and joint decoding. Above quantum or classical capacity, entanglement fidelity or decoding success probability, respectively, decays exponentially with the number of channel uses. Above private capacity, fidelity to an ideal shared secret key decays exponentially; in particular, vanishing secrecy error forces decoding success to vanish. The proofs combine one-shot quantum blowing-up lemmas, which convert codes with low success into reliable codes with a controlled loss in code size, with a low-degree polynomial approximation of the channel's Stinespring image projector. The loss is governed by the projective tensor norm of the approximation across the receiver--environment bipartition. For memoryless channels, the polynomial construction gives exponential accuracy while keeping the rate loss arbitrarily small, turning the corresponding weak converses into strong converses.
We show that the capacity of a quantum channel demarcates a phase transition: while reliable transmission below capacity is always possible, any attempt to transmit information above it fails catastrophically. Specifically, we prove exponential strong converse theorems for unassisted quantum and classical communication over arbitrary finite-dimensional memoryless quantum channels. At rates beyond the respective capacity, the entanglement-generation fidelity and the success probability for classical communication decay exponentially with the number of channel uses. This rules out transmission above capacity even when one tolerates arbitrarily large errors. Our proof follows the classical Arimoto strategy, augmented by a crucial new ingredient: integral representations of Rényi information measures that lead to asymptotic continuity bounds for Rényi capacities.
We prove a strong converse for quantum communication over Pauli channels within the class of stabilizer codes. If a code whose code space is a full joint eigenspace of a stabilizer group transmits above the coherent information of its own input state, its entanglement fidelity decays exponentially in the block length; the encoder may be any isometry onto that space and the decoder any channel. For memoryless channels this determines the ε\varepsilonε-quantum capacity of the class for every ε<1\varepsilon < 1ε<1, so that tolerating a constant error buys no rate; for antidegradable channels, such as the depolarizing channel with error probability p∈[1/4,3/4]p \in [1/4, 3/4]p∈[1/4,3/4], that capacity is zero, while for p∈[1/4,1/2)p \in [1/4,1/2)p∈[1/4,1/2) partial-transposition bounds provably cannot certify a strong converse. The proof uses neither additivity assumptions nor semidefinite relaxations: optimal decoding succeeds precisely on an event in a product probability space, so the blowing-up lemma of Ahlswede, Gács and Körner applies, and the side information it produces is charged against the coherent information. The argument also constrains near-deterministic decoding for codes of any kind, and we isolate the encoder-side statement that would extend it to all of them.
Traditionally, Quantum Information, and Quantum Communication specifically, have been focused on qubit-based architectures. Recent results, however, highlighted that higher dimensional architectures (qudit-based) may present advantages both in terms of communication and computation; a family of channels called Multi-level Amplitude Damping (MAD) channels, which are a possible qudit generalization of the well known Amplitude Damping Channels, is able to model energy decay processes that may happen during signal transmission. In this work, the Quantum Capacity of 4-dimensional MAD's is studied, relying on a technique for computing it even outside of degradable and antidegradable conditions. We also characterized the complete region of antidegradability and degradability in the parameter space for a generic d-dimensional MAD using both analytical and semi-numerical methods.
We establish exponential strong converse theorems for blind quantum data compression of finite-dimensional mixed-state sources, with and without entanglement assistance. Blind compression is a fundamental quantum information processing task in which the sender aims to transmit quantum states without direct access to the classical label. Strong converse is a notable aspect of data compression: the accuracy of the compression abruptly drops down to zero once the compression rate goes below a threshold. Strong converses for data compression have been established for pure-state sources; however, for mixed-state sources, the optimal compression rate is determined by a structural decomposition of quantum states and can change substantially under small perturbations. This sensitivity makes it difficult to quantitatively analyze the trade-off between compression rate and error. Despite recent progress, whether a strong converse holds at the optimal rate has remained unresolved in general. In this work, we resolve this question affirmatively. For unassisted compression, we show that at every rate below the optimum, the accuracy decays exponentially with the block length for general mixed-state sources without restrictions on protocols. We also prove exponential strong converse for blind compression with unlimited entanglement assistance at its optimal rate. Combining the two strong converse bounds yields exponential decay at every compression-entanglement rate pair outside the complete achievable rate region. Our proof introduces a new overlap quantity based on the structure of quantum states; this quantity connects preservation of the source information to the dimension of the transmitted system. We expect that this approach provides useful tools for converse analyses of other quantum information-processing tasks involving mixed states.