On small perturbations of coherent information

• URL: http://arxiv.org/abs/2507.16920v1
• Date: Tue, 22 Jul 2025 18:02:27 GMT
• Title: On small perturbations of coherent information
• Authors: Zhen Wu, Zhihao Ma, James Fullwood,
• Abstract summary: 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.
• Score: 7.078713722203906
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum capacity quantifies the amount of quantum information that can be transmitted by a quantum channel with an arbitrary small probability of error. Mathematically, the quantum capacity is given by an asymptotic formula involving the one-shot quantum capacity of the associated channel, which, due to purely quantum effects such as superadditivity of one-shot quantum capacity, is rarely computable. The one-shot quantum capacity is mathematically characterized in terms of optimizing an entropic quantity referred to as coherent information over all possible input states of a channel, the computation of which also tends to be intractable due to the difficulty of optimizing the coherent information. In this work, we develop perturbative methods for analyzing the behavior of coherent information of a quantum channel with respect to small perturbations of the input state. By doing so, we are able to derive three general criteria for determining whether an input state yields suboptimal coherent information. We then 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. The utility of our criteria is illustrated through examples, which yield new results regarding the one-shot quantum capacity of qubit depolarizing channels, Pauli channels and dephrasure channels.

Related papers

• Capability of anti-degradable quantum channel with additional entanglement [0.0]
  We show that a type of quantum channel known as the anti-degradable one-mode Gaussian channel can be activated" to transmit quantum information.<n>Beyond its theoretical implications, this activation can also be realized in practical systems.
  arXiv  Detail & Related papers  (2025-01-12T15:17:00Z)
• 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)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• An operational definition of quantum information scrambling [0.0]
  Quantum information scrambling (QIS) is a characteristic feature of several quantum systems. We propose a novel and computationally efficient QIS quantifier based on a formulation of QIS in terms of quantum state discrimination. We show that the optimal guessing probability, which reflects the degree of QIS induced by an isometric quantum evolution, is directly connected to the accessible min-information.
  arXiv  Detail & Related papers  (2023-12-18T19:00:01Z)
• Estimate distillable entanglement and quantum capacity by squeezing useless entanglement [5.086696108576776]
  Quantum Internet relies on quantum entanglement as a fundamental resource for secure and efficient quantum communication. It remains challenging to accurately estimate the distillable entanglement and its closely related essential quantity, the quantum capacity. We propose efficiently computable upper bounds for both quantities based on the idea that the useless entanglement within a state or a quantum channel does not contribute to the distillable entanglement or the quantum capacity.
  arXiv  Detail & Related papers  (2023-03-13T16:02:18Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• An additive refinement of quantum channel capacities [0.0]
  Capacities of quantum channels are fundamental quantities in the theory of quantum information.<n>Asymptotic regularization is generically necessary making the study of capacities notoriously hard.<n>We prove additive quantities for quantum channel capacities that can be employed for quantum Shannon theorems.
  arXiv  Detail & Related papers  (2022-05-15T07:21:38Z)
• 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)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• One-shot quantum state redistribution and quantum Markov chains [15.66921140731163]
  We revisit the task of quantum state redistribution in the one-shot setting. We design a protocol for this task with communication cost in terms of a measure of distance from quantum Markov chains. Our result is the first to operationally connect quantum state redistribution and quantum chains.
  arXiv  Detail & Related papers  (2021-04-18T07:34:22Z)
• 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)

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.