No information transmission through quantum channels above capacity

• URL: http://arxiv.org/abs/2609.08998v1
• Date: Tue, 08 Sep 2026 16:37:23 GMT
• Title: No information transmission through quantum channels above capacity
• Abstract summary: 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.
• Score: 24.557755528031453
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Simultaneous Classical and Quantum Communications: Recent Progress and Three Challenges [52.931372025288844]
  We explore novel protocols that enable simultaneous classical and quantum communications.<n>We extend quantum communication capabilities beyond traditional optical bands into the terahertz.<n>We identify open problems that must be addressed to facilitate practical implementation.
  arXiv  Detail & Related papers  (2025-12-11T00:27:08Z)
• Retrocausal capacity of a quantum channel [12.220177153326562]
  We study the capacity of a quantum channel for retrocausal communication, where messages are transmitted backward in time.<n>We show that the corresponding capacities are equal to the average and sum, respectively, of the channel's max-information and its regularized Doeblin information.
  arXiv  Detail & Related papers  (2025-09-10T19:53:23Z)
• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the multimode extreme bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.<n>Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Fully quantum arbitrarily varying channel coding for entanglement-assisted communication [0.0]
  We study the problem of entanglement-assisted capacity in the presence of system uncertainty. We find that, under the assumption of a finite environment dimension, it is equal to a corresponding compound capacity. Our results imply that in certain fully quantum arbitrarily varying channel models, the entanglement-assisted capacity can be positive while the classical capacity is equal to zero.
  arXiv  Detail & Related papers  (2024-04-12T02:10:04Z)
• On Simultaneous Information and Energy Transmission through Quantum Channels [15.387256204743407]
  We introduce the quantum-classical analogue of the capacity-power function.<n>We generalize results in classical information theory for transmitting classical information through noisy channels.
  arXiv  Detail & Related papers  (2023-09-24T16:46:47Z)
• 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)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Multipartite entanglement to boost superadditivity of coherent information in quantum communication lines with polarization dependent losses [0.0]
  We show that in the limit of the infinite number of channel uses the superadditivity phenomenon takes place whenever the channel is neither degradable nor antidegradable. We also provide a method how to modify the proposed states and get a higher quantum communication rate by doubling the number of channel uses.
  arXiv  Detail & Related papers  (2021-09-08T12:24:44Z)
• Capacity of trace decreasing quantum operations and superadditivity of coherent information for a generalized erasure channel [0.0]
  We analyze biased trace decreasing quantum operations that assign different loss probabilities to states. We find lower and upper bounds for the classical and quantum capacities of the generalized erasure channel. We reveal superadditivity of coherent information in the case of the polarization dependent losses.
  arXiv  Detail & Related papers  (2021-01-14T16:04:44Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• 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)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

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.