Communication with Unreliable Entanglement Assistance

Uzi Pereg, Christian Deppe, Holger Boche

Abstract

Quantum entanglement is a powerful resource for communication, but its distribution is often unreliable due to channel loss. This paper investigates a scenario where a transmitter sends information without knowing if the entanglement resource successfully reached the receiver. By deriving capacity regions and proposing a quantum adaptation of superposition coding, the authors demonstrate that sophisticated quantum strategies can significantly outperform standard time-sharing approaches in noisy environments.

Introduction

In the burgeoning field of quantum networking, entanglement assistance is a cornerstone for enhancing communication rates. By sharing an entangled state, a transmitter (Alice) and a receiver (Bob) can surpass the classical limits of a noisy channel. However, entanglement is notoriously fragile; photons used to distribute entanglement are frequently absorbed or scattered. In practical settings, Alice may not know if the entanglement distribution succeeded before she must transmit her message. While feedback could inform her, the resulting delay often leads to the decoherence of the remaining quantum state, rendering it useless.

The Unreliable Entanglement Model

The authors address this challenge by modeling communication with "unreliable" entanglement assistance. In this framework, Alice is "ignorant" of the entanglement status, while Bob is "informed." The objective is to design an encoding strategy that guarantees a base transmission rate ($R$) if entanglement fails, while providing an additional "excess" rate ($R'$) if it succeeds.

The system model for unreliable entanglement assistance. (a) shows successful entanglement distribution (switch closed), while (b) depicts the failure case where Bob lacks the entanglement resource.

Methods: Quantum Superposition Coding

To achieve optimal rates in this setting, the paper adapts the classical technique of Superposition Coding (SPC) to the quantum regime. In classical SPC, information is layered into "cloud centers" representing coarse data and "satellites" representing fine-grained data.

Visualization of the input space for Superposition Coding, showing cloud centers ($σ_m$) for guaranteed messages and satellites ($ρ_{m,m'}$) for excess messages.

In the quantum version, Alice prepares an encoding that maps classical messages to specific quantum states. If Bob finds himself without entanglement, he decodes only the "cloud" (the guaranteed message $m$). If entanglement is available, he leverages it to decode the "satellites" (the excess message $m'$), effectively extracting more information from the same physical transmission.

Key Insights and Results

A central finding of the research is that for noisy channels, such as the qubit depolarizing channel, a quantum superposition of encoding strategies is strictly superior to traditional time-sharing. While time-sharing involves alternating between an entanglement-assisted strategy and a non-assisted one, the proposed quantum SPC allows Alice to be in a "superposition" of these modes, expanding the achievable capacity region.

The authors provide formal, regularized capacity formulas for both classical and quantum information transmission. Their numerical analysis shows that for a depolarizing channel with a noise level of $ε = 0.5$, the SPC strategy yields a significantly larger achievable rate region than time-sharing. This suggests that "reliability by design"—where a system gracefully degrades from a high-performance mode to a guaranteed baseline—is not only possible but highly efficient in quantum networks.

Conclusion

This work shifts the paradigm of quantum communication from maximizing average throughput to managing the trade-off between guaranteed and opportunistic service. Such robust protocols are essential for future applications like the "Tactile Internet," where low-latency, high-reliability communication is paramount. Future research will focus on simplifying the complex "regularized" formulas into more computable "single-letter" versions and extending these principles to multi-user broadcast networks.

Summary updated

BibTeX
@article{pereg2023communication,
  author = {Uzi Pereg and Christian Deppe and Holger Boche},
  title = {{Communication with Unreliable Entanglement Assistance}},
  journal = {IEEE Trans. Information Theory},
  year = {2023},
  doi = {10.1109/tit.2023.3253600},
}
Figure