A pretty-tight converse on the classical capacity of generalized amplitude-damping channels

• URL: http://arxiv.org/abs/2609.14621v1
• Date: Sun, 13 Sep 2026 15:50:01 GMT
• Title: A pretty-tight converse on the classical capacity of generalized amplitude-damping channels
• Abstract summary: capacity of the generalized amplitude-damping channel remains an open problem in quantum Shannon theory.<n>We derive a relaxation of this measure that makes the converse bound efficiently computable.<n>Our bound is pretty tight in general and nearly coincides with the Holevo information at nonzero temperatures.
• Score: 2.3738674379518128
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The classical capacity of a quantum channel is the highest rate at which classical information can be transmitted with vanishing error. Although the capacities of many fundamental quantum channels have been established, the capacity of the generalized amplitude-damping channel remains an open problem in quantum Shannon theory. In this work, we revisit a converse bound introduced by Brandão et al. [Phys. Rev. Lett. 106, 230502 (2011)], which upper-bounds the classical capacity in terms of a correlation measure. For the generalized amplitude-damping channel, we derive a relaxation of this measure that makes the converse bound efficiently computable. Numerical comparisons demonstrate that our bound is pretty tight in general and nearly coincides with the Holevo information at nonzero temperatures, significantly improving upon existing bounds across the entire parameter range.

Related papers

• 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)
• Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels [0.0]
  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.
  arXiv  Detail & Related papers  (2026-08-02T15:23:46Z)
• 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)
• Enhanced quantum capacity thresholds from symmetry [2.8241852537721353]
  We show significant increases in capacity thresholds of two prototypical noise models.<n>In the case of the depolarizing channel, this is the first improvement in 18 years.<n>A representation theoretic calculation shows that exponentially many Kraus operators of the channel annihilate the symmetric space.
  arXiv  Detail & Related papers  (2026-05-09T19:44:57Z)
• 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)
• Semidefinite Programming for Quantum Channel Learning [35.18016233072556]
  Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi matrix.<n>We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of quantum channels of different forms.<n>This suggests that a relatively small Kraus rank quantum channel is typically sufficient to describe experimentally observed classical data.
  arXiv  Detail & Related papers  (2026-01-18T17:26:45Z)
• Stochastic Quantum Information Geometry and Speed Limits at the Trajectory Level [35.18016233072556]
  We bridge the gap between quantum information geometry and thermodynamics by introducing the Conditional Quantum Fisher Information (CQFI)<n>We show that the CQFI admits a decomposition into incoherent (population) and coherent (basis rotation) contributions, augmented by a transient interference cross-term absent at the ensemble level.
  arXiv  Detail & Related papers  (2026-01-18T16:23:26Z)
• Information capacity analysis of fully correlated multi-level amplitude damping channels [0.9790236766474201]
  We investigate some of the information capacities of the simplest member of multi-level Amplitude Damping Channel, a qutrit channel. We find the upper bounds of the single-shot classical capacities and calculate the quantum capacities associated with a specific class of maps.
  arXiv  Detail & Related papers  (2023-05-08T06:10:56Z)
• The superadditivity effects of quantum capacity decrease with the dimension for qudit depolarizing channels [0.0]
  We study how the gain in quantum capacity of qudit depolarizing channels relates to the dimension of the systems considered. We conclude that when high dimensional qudits experiencing depolarizing noise are considered, the coherent information of the channel is not only an achievable rate but essentially the maximum possible rate for any quantum block code.
  arXiv  Detail & Related papers  (2023-01-24T16:54:09Z)
• 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)
• 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.