Communication Advantages from Quantum Dense Network Coding
Abstract
A central problem in quantum information theory is understanding how quantum resources can be used to communicate information more efficiently than classical resources. 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 by not transmitting the entirety of the function inputs. 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 in the number of senders. Finally, 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.
Related
- Deep Learning-Based Multi-User Communication Design for Dense IoT Networks: Interference-Aware Finite-Blocklength Communication and Preliminary MIMO Extensions
- Masked Neural Detection for Run-Length-Limited Channel Coding in Molecular Communication
- Feedback Coding Enables Inference-Time Covert Agentic Communication
- Dense auto-hetero associative memories applied to noisy communication channels
- Estimation and Recovery of a Planted Dense Subgraph from a Single Network Cascade
BibTeX
@misc{george2026communication,
title = {{Communication Advantages from Quantum Dense Network Coding}},
author = {Ian George and Brian Doolittle},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2607.08133},
eprint = {2607.08133},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.08133},
}
RIS
TY - UNPB
TI - Communication Advantages from Quantum Dense Network Coding
AU - Ian George
AU - Brian Doolittle
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2607.08133
UR - https://arxiv.org/abs/2607.08133
AB - A central problem in quantum information theory is understanding how quantum resources can be used to communicate information more efficiently than classical resources. 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 by not transmitting the entirety of the function inputs. 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 in the number of senders. Finally, 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.
ER -