Universal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender

Holger Boche, Gisbert Janßen, Sajad Saeedinaeeni

Introduction

In the development of quantum communication networks, a common theoretical assumption is that the communication channel is perfectly characterized. However, in practical deployments—such as quantum signals sharing existing fiber optic infrastructure with classical traffic—the exact noise parameters and channel states are often uncertain. This paper addresses this challenge by investigating the compound quantum multiple-access channel (QMAC). Specifically, it focuses on a hybrid scenario where one sender (Sender A) transmits classical information and a second sender (Sender B) transmits quantum information (entanglement) to a single receiver.

The Problem: Communication Under Uncertainty

A compound channel models a scenario where the actual communication channel is an unknown element of a pre-defined uncertainty set. For a Multiple-Access Channel (MAC), the goal is to determine the capacity region: the set of all rate pairs $(R_1, R_2)$—representing classical and quantum transmission rates, respectively—that can be achieved with vanishingly small error, regardless of which specific channel from the uncertainty set is actually being used.

This research is motivated by the reality that dedicated "dark fiber" for quantum communication is rare. Quantum users will likely have to share noisy, uncertain commercial lines with classical users, necessitating codes that are robust to channel fluctuations without requiring real-time channel estimation.

Methodology: Universal Random Coding

The authors prove the existence of universal random codes that achieve optimal transmission rates even when the communicating parties do not know the exact channel parameters. Their approach involves a sophisticated hybridization of two existing coding strategies:

  1. Universal Classical-Quantum (cq) Codes: Used for Sender A to transmit classical bits.
  2. Decoupling-Based Universal Codes: Used for Sender B to transmit entanglement.

By merging these techniques, the researchers constructed a hybrid code capable of handling both data types simultaneously. The paper provides a rigorous mathematical framework, including an achievability proof (demonstrating that certain rates are possible) and a converse proof (using Fano’s inequality and the Holevo bound to show that no code can exceed these rates).

Key Insights and Results

Multi-letter Characterization

The core result of the paper is Theorem 3, which provides the first definitive mathematical formula for the capacity region $CQ(\mathcal{M})$. The capacity is characterized in a "multi-letter" format, meaning it is defined as an asymptotic limit over $n$ uses of the channel as $n \to \infty$.

The Capacity Region Bounds

The achievable rate region is defined by the intersection of the capacity regions of every individual channel within the uncertainty set. The bounds are determined by:

  • Classical Rate ($R_1$): Limited by the Mutual Information $I(X; C, \omega)$ between the classical sender and the receiver.
  • Quantum Rate ($R_2$): Limited by the Coherent Information $I_c(B \rangle CX, \omega)$ between the quantum sender and the receiver.

Equivalence of Tasks

A significant theoretical finding is that in this compound setting, the capacity region for entanglement transmission (sending a quantum state) is identical to the region for entanglement generation (establishing a shared quantum state with the receiver).

Limitations and Future Outlook

While this work establishes a foundational characterization of hybrid compound QMACs, several challenges remain:

  • Computational Complexity: The "multi-letter" nature of the result, while mathematically precise, is difficult to evaluate for specific real-world channels. A "single-letter" formula remains a major open objective in the field.
  • Geometric Refinement: The authors suggest that the current "rectangular" characterization of one-shot regions might be refined into "pentagonal" boundaries, similar to classical MAC theory, which could lead to more efficient capacity formulas.
  • Arbitrarily Varying Channels (AVQMAC): The compound model assumes the channel remains constant (though unknown) during transmission. A more complex extension involves channels that change with every use, potentially due to active interference or jamming. This paper provides the necessary groundwork to tackle these more adversarial communication environments.

Summary updated

BibTeX
@article{boche2019universal,
  author = {Holger Boche and Gisbert Janßen and Sajad Saeedinaeeni},
  title = {{Universal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender}},
  journal = {Quantum Inf. Process},
  year = {2019},
  doi = {10.1007/s11128-019-2358-7},
}
Figure