Quantum conditional mutual information and channel capacity

• URL: http://arxiv.org/abs/2606.25264v1
• Date: Wed, 24 Jun 2026 01:01:57 GMT
• Title: Quantum conditional mutual information and channel capacity
• Abstract summary: We show that the optimal rate for establishing quantum correlation between two parties, assisted by a third system, is given by half the QCMI.<n>This result naturally extends the classical key generation capacity of Csiszr and Ahlswede to the quantum domain.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Information measures acquire operational meaning through coding theorems. The quantum conditional mutual information (QCMI) is nonnegative due to strong subadditivity, yet a direct connection with channel coding has remained elusive. In this work, we propose a quantum communication task-conditional quantum communication-that fills this gap. We show that the optimal rate for establishing quantum correlation between two parties, assisted by a third system, is given by half the QCMI. This result naturally extends the classical key generation capacity of Csiszár and Ahlswede to the quantum domain. We place our model within the family tree of quantum protocols and compute the conditional capacity for several example channels. Our results provide new insights for code design in reliable quantum information processing.

Related papers

• Communication Advantages from Quantum Dense Network Coding [1.7188280334580195]
  We introduce quantum dense network coding -- a protocol that transmits the output of a non-Boolean function to a receiver using provably half as many qubits as bits for each sender.<n>We show this advantage requires both shared entanglement and quantum communication, is robust to noise, and the gap in success probability between quantum and classical communication can be amplified exponentially.<n>We show that dense network coding gives rise to a novel, information-theoretically secure, quantum cryptographic protocol, which we call measurement-device-independent quantum key growing.
  arXiv  Detail & Related papers  (2026-07-09T06:08:43Z)
• 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)
• Transport approach to quantum state tomography [0.0]
  Quantum state tomography (QST) is a central task for quantum information processing, enabling quantum cryptography, computation, and state certification.<n>Traditional QST relies on projective measurements of single- and two-qubit Pauli operators, requiring the system of interest to be isolated from environmental dissipation.<n>We demonstrate that measuring currents and associated transport quantities flowing through a quantum system in an open configuration enable the reconstruction of its quantum state.
  arXiv  Detail & Related papers  (2025-01-28T09:50:23Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• 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)
• 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)
• Probably approximately correct quantum source coding [0.0]
  Holevo's and Nayak's bounds give an estimate of the amount of classical information that can be stored in a quantum state. We show two novel applications in quantum learning theory and delegated quantum computation with a purely classical client.
  arXiv  Detail & Related papers  (2021-12-13T17:57:30Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)

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.