Simultaneous superadditivity of the direct and complementary channel capacities

• URL: http://arxiv.org/abs/2301.05142v1
• Date: Thu, 12 Jan 2023 16:58:12 GMT
• Title: Simultaneous superadditivity of the direct and complementary channel capacities
• Authors: Satvik Singh and Sergii Strelchuk
• Abstract summary: We show that coherent and private information of a channel and its complement can be simultaneously superadditive for arbitrarily many channel uses. For a varying number of channel uses, we show that these quantities can obey different interleaving sequences of inequalities.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum communication channels differ from their classical counterparts because their capacities can be superadditive. The principle of monogamy of entanglement suggests that superadditive improvements in the transmission capacity of a channel should reduce the amount of information loss to the environment. We challenge this intuition by demonstrating that the coherent and private information of a channel and its complement can be simultaneously superadditive for arbitrarily many channel uses. To quantify the limits of this effect, we consider the notion of max (resp. total) private information of a channel, which represents the maximum (resp. sum) of the private information of the channel itself and its complement, and study its relationship with the coherent information of the individual direct and complementary channels. For a varying number of channel uses, we show that these quantities can obey different interleaving sequences of inequalities.

Related papers

• 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)
• Distilling Channels for Efficient Deep Tracking [68.13422829310835]
  This paper presents a novel framework termed channel distillation to facilitate deep trackers. We show that an integrated formulation can turn feature compression, response map generation, and model update into a unified energy minimization problem. The resulting deep tracker is accurate, fast, and has low memory requirements.
  arXiv  Detail & Related papers  (2024-09-18T08:09:20Z)
• 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 Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered. We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters. Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• Experimental Communication Through Superposition of Quantum Channels [0.0]
  Coherently controlling channels necessitates a non-trivial expansion of the channel description. We show that the expanded qutrit channel description in itself is sufficient to explain the capacity enhancement without any use of superposition.
  arXiv  Detail & Related papers  (2023-02-28T18:18:10Z)
• 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)
• The platypus of the quantum channel zoo [12.4245398967236]
  We study a simple, low-dimensional family of quantum channels with exotic quantum information-theoretic features. We generalize the qutrit channel in two ways, and the resulting channels and their capacities display similarly rich behavior.
  arXiv  Detail & Related papers  (2022-02-16T23:54:07Z)
• Detecting positive quantum capacities of quantum channels [9.054540533394926]
  A noisy quantum channel can be used to reliably transmit quantum information at a non-zero rate. This is because it requires computation of the channel's coherent information for an unbounded number of copies of the channel. We show that a channel's ability to transmit information is intimately connected to the relative sizes of its input, output, and environment spaces.
  arXiv  Detail & Related papers  (2021-05-13T14:26:45Z)
• 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)
• Operation-Aware Soft Channel Pruning using Differentiable Masks [51.04085547997066]
  We propose a data-driven algorithm, which compresses deep neural networks in a differentiable way by exploiting the characteristics of operations. We perform extensive experiments and achieve outstanding performance in terms of the accuracy of output networks.
  arXiv  Detail & Related papers  (2020-07-08T07:44:00Z)
• 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.