Extreme Capacities in Generalized Direct Sum Channels

• URL: http://arxiv.org/abs/2510.10711v1
• Date: Sun, 12 Oct 2025 17:25:18 GMT
• Title: Extreme Capacities in Generalized Direct Sum Channels
• Authors: Zhen Wu, Si-Qi Zhou,
• Abstract summary: We construct the generalized direct sum (GDS) channel, extending conventional direct sum channels through a direct sum structure in their Kraus operators.<n>This construction forms the basis of the GDS framework, encompassing classes of channels with single-letter formula for quantum capacities and others exhibiting striking capacity features.
• Score: 9.35201227314384
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum channel capacities play a central role in quantum Shannon theory, a formalism built upon rigorous coding theorems for noisy channels. Evaluating exact capacity values for general quantum channels remains intractable due to superadditivity. As a step toward understanding this phenomenon, we construct the generalized direct sum (GDS) channel, extending conventional direct sum channels through a direct sum structure in their Kraus operators. This construction forms the basis of the GDS framework, encompassing classes of channels with single-letter formula for quantum capacities and others exhibiting striking capacity features. The quantum capacity can approach zero yet display unbounded superadditivity combined with erasure channels. Private and classical capacities coincide and can become arbitrarily large, resulting in an unbounded gap with the quantum capacity. Providing a simpler and more intuitive approach, the framework deepens our understanding of quantum channel capacities.

Related papers

• 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)
• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• Super-additivity of quantum capacity in simple channels [17.117408296103363]
  Super-additivity of quantum capacity is an important feature of quantum information theory.<n>Generalized platypus channel still displays the super-additivity of quantum capacity when combined with qudit erasure channels and multilevel amplitude damping channels respectively.
  arXiv  Detail & Related papers  (2025-05-30T14:48:32Z)
• Additivity of quantum capacities in simple non-degradable quantum channels [3.9901365062418312]
  We show that channels capable of outperforming" their environment can exhibit either strong or weak additivity of coherent information.<n>We explore a complementary construction that modifies a channel to preserve coherent information additivity while destroying the outperforming" property.
  arXiv  Detail & Related papers  (2024-09-05T22:17:29Z)
• 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)
• 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)
• Exact solution for the quantum and private capacities of bosonic dephasing channels [10.787390511207686]
  We provide the first exact calculation of the quantum, private, two-way assisted quantum, and secret-key capacities of bosonic dephasing channels.
  arXiv  Detail & Related papers  (2022-05-11T19:12:12Z)
• 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)
• Creating and destroying coherence with quantum channels [62.997667081978825]
  We study optimal ways to create a large amount of quantum coherence via quantum channels. correlations in multipartite systems do not enhance the ability of a quantum channel to create coherence. We show that a channel can destroy more coherence when acting on a subsystem of a bipartite state.
  arXiv  Detail & Related papers  (2021-05-25T16:44:13Z)
• Coherent control and distinguishability of quantum channels via PBS-diagrams [59.94347858883343]
  We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS) We characterise the observational equivalence of purified channels in various coherent-control contexts, paving the way towards a faithful representation of quantum channels under coherent control.
  arXiv  Detail & Related papers  (2021-03-02T22:56:25Z)
• Partially Coherent Direct Sum Channels [4.2231191686871234]
  We introduce Partially Coherent Direct Sum (PCDS) quantum channels, as a generalization of the already known Direct Sum quantum channels. We derive necessary and sufficient conditions to identify a subset of those maps which are degradable, and provide a simplified expression for their quantum capacities.
  arXiv  Detail & Related papers  (2020-08-02T14:36:11Z)
• Quantum Channel State Masking [78.7611537027573]
  Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
  arXiv  Detail & Related papers  (2020-06-10T16:18:03Z)
• 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.