Additivity of quantum capacities in simple non-degradable quantum channels

• URL: http://arxiv.org/abs/2409.03927v4
• Date: Fri, 20 Jun 2025 23:38:47 GMT
• Title: Additivity of quantum capacities in simple non-degradable quantum channels
• Authors: Graeme Smith, Peixue Wu,
• Abstract summary: 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.
• Score: 3.9901365062418312
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum channel capacities give the fundamental performance limits for information flow over a communication channel. However, the prevalence of superadditivity is a major obstacle to understanding capacities, both quantitatively and conceptually. In contrast, examples exhibiting additivity, though relatively rare, offer crucial insights into the origins of nonadditivity and form the basis of our strongest upper bounds on capacity. Degradable channels, whose coherent information is provably additive, stand out as among the few classes of channels for which the quantum capacity is exactly computable. In this paper, we introduce two families of non-degradable channels whose coherent information remains additive, making their quantum capacities tractable. First, we demonstrate that channels capable of ``outperforming" their environment, under conditions weaker than degradability, can exhibit either strong or weak additivity of coherent information. Second, we explore a complementary construction that modifies a channel to preserve coherent information additivity while destroying the ``outperforming" property. We analyze how structural constraints guarantee strong and weak additivity and investigate how relaxing these constraints leads to the failure of strong additivity, with weak additivity potentially persisting.

Related papers

• On small perturbations of coherent information [7.078713722203906]
  Quantum capacity quantifies the amount of quantum information that can be transmitted by a quantum channel with an arbitrary small probability of error.<n>We develop perturbative methods for analyzing the behavior of coherent information of a quantum channel with respect to small perturbations of the input state.<n>We show how our criteria yield sufficient conditions for superadditivity of one-shot quantum capacity, and also for detecting a positive gap between one-shot private capacity and one-shot quantum capacity.
  arXiv  Detail & Related papers  (2025-07-22T18:02:27Z)
• 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)
• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode 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. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
  We address the problem of reliable provision of entangled qubits in quantum computing schemes. We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC) Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
  arXiv  Detail & Related papers  (2023-05-01T17:13:23Z)
• Noise is resource-contextual in quantum communication [1.8749305679160366]
  Estimating the information transmission capability of a quantum channel remains one of the fundamental problems in quantum information processing. One of the most significant manifestations of this is the superadditivity of the channel capacity. Our constructions demonstrate that noise is context dependent in quantum communication.
  arXiv  Detail & Related papers  (2023-05-01T06:24:03Z)
• 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 power of noisy quantum states and the advantage of resource dilution [62.997667081978825]
  Entanglement distillation allows to convert noisy quantum states into singlets. We show that entanglement dilution can increase the resilience of shared quantum states to local noise.
  arXiv  Detail & Related papers  (2022-10-25T17:39:29Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• 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)
• Generic nonadditivity of quantum capacity in simple channels [12.4245398967236]
  Super-additivity of quantum capacity occurs between two weakly additive channels each with large capacity on their own. Our results show that super-additivity is much more prevalent than previously thought.
  arXiv  Detail & Related papers  (2022-02-16T23:43:18Z)
• 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)
• 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)
• 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)
• Leaking information to gain entanglement [3.8073142980733]
  We find that engaging a system with its environment increases its ability to retain entanglement. We counter-intuitively boost the quantum capacity of a channel by leaking almost all quantum information to the channel's environment.
  arXiv  Detail & Related papers  (2020-11-30T18:49:45Z)
• 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)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)
• Entropic singularities give rise to quantum transmission [3.8073142980733]
  Non-additivity allows quantum devices (aka quantum channels) to send more information than expected. We prove a general theorem concerning positivity of a channel's coherent information. A wide class of zero quantum capacity qubit channels can assist an incomplete erasure channel in sending quantum information.
  arXiv  Detail & Related papers  (2020-03-23T16:32: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.