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

• URL: http://arxiv.org/abs/2608.01308v1
• Date: Sun, 02 Aug 2026 15:23:46 GMT
• Title: Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels
• Abstract summary: We prove an exponential strong converse for every finite-dimensional degradable and antidegradable channel.<n>We also show that exponential strong-converse bounds are preserved under receiver post-processing.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Strong converse for the quantum capacity of the pure-loss bosonic channel [13.706331473063882]
  The entanglement-generation fidelity of every code is bounded by a constant times the reciprocal of the number of channel uses.<n>The proof combines quantum Chebyshev and hockey-stick testing inequalities with a uniform relative-entropy-variance bound for the balanced pure-loss channel.<n>The resulting argument establishes the strong converse at the unconstrained quantum capacity for every pure-loss bosonic channel.
  arXiv  Detail & Related papers  (2026-09-15T04:10:13Z)
• Strong Converse for Quantum Capacity via a Fully Quantum Blowing-Up Lemma [14.896509623302839]
  We prove an exponential strong converse for quantum communication through every finite-dimensional memoryless channel.<n>First, a fully quantum blowing-up lemma converts a low-fidelity code into a high-fidelity code.<n>Second, a low-degree construction approximates the power of this projector with exponential accuracy while controlling its projective norm.
  arXiv  Detail & Related papers  (2026-09-10T16:25:56Z)
• No information transmission through quantum channels above capacity [24.557755528031453]
  We show that the capacity of a quantum channel demarcates a phase transition.<n>We prove exponential strong converse theorems for unassisted quantum and classical communication.
  arXiv  Detail & Related papers  (2026-09-08T16:37:23Z)
• Asymptotic Limits of Entanglement Distribution [43.748379918040854]
  We investigate the limits of entanglement distribution across quantum networks utilizing intermediate stations and local operations.<n>We establish a strict dichotomy: the preservation of entanglement over arbitrarily long distances is possible if the underlying quantum channel admits a correctable subspace.<n>We derive a fundamental lower bound on the physical resource requirements, proving that for channels without a correctable subspace, the number of parallel channels per link must scale at least logarithmically with the number of intermediate stations to sustain a non-zero amount of entanglement.
  arXiv  Detail & Related papers  (2026-05-22T09:56:38Z)
• Convex combinations of bosonic pure-loss channels [4.458381173954051]
  We show that entanglement distribution and quantum key distribution can always be achieved at a strictly positive rate over any fading channel.<n>We identify regimes where the coherent information of thermal inputs vanishes, while optimized non-Gaussian states achieve strictly positive values.
  arXiv  Detail & Related papers  (2026-04-29T16:42:12Z)
• Strong converse bounds on the classical identification capacity of the qubit depolarizing channel [8.921166277011347]
  A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the identification rate of classical messages sent through the channel.<n>We derive strong converse bounds for the qubit depolarizing channel with noise parameter $p$, that vanish as $pto 1$.<n>In the setting of simultaneous classical identification under the constraint of complete product measurements, our converse bound matches the corresponding achievability bound.
  arXiv  Detail & Related papers  (2026-03-31T16:51:25Z)
• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Improving quantum communication rates with permutation-invariant codes [6.107978190324034]
  We improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes.<n>For each channel family we obtain improved lower bounds on their quantum capacities.
  arXiv  Detail & Related papers  (2025-08-13T17:47:51Z)
• Flagged Extensions and Numerical Simulations for Quantum Channel Capacity: Bridging Theory and Computation [0.0]
  I will investigate the capacities of noisy quantum channels through a combined analytical and numerical approach.<n>I introduce novel flagged extension techniques that embed a channel into a higher-dimensional space.<n>My results refine previous bounds and clarify noise thresholds beyond which quantum transmission vanishes.
  arXiv  Detail & Related papers  (2025-06-03T22:21:08Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [49.126395046088014]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets.<n>Our main findings are that the maximum length of messages thus identifiable scales superlinearly as $R,nlog n$ with the block length $n$.<n>We show that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• Channel Simulation: Finite Blocklengths and Broadcast Channels [13.561997774592667]
  We study channel simulation under common randomness assistance in the finite-blocklength regime. We identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.
  arXiv  Detail & Related papers  (2022-12-22T13:08:55Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.