Practical route to entanglement-assisted communication over noisy bosonic channels
Haowei Shi, Zheshen Zhang, Quntao Zhuang

TL;DR
This paper presents practical encoding and decoding schemes that leverage entanglement to significantly enhance classical communication over noisy bosonic channels, overcoming fundamental limits and enabling applications in radio-frequency and microwave ranges.
Contribution
It introduces structured encoding and decoding methods for entanglement-assisted communication over noisy bosonic channels, including phase encoding schemes that saturate capacity and surpass covert communication limits.
Findings
Phase encoding on entangled states saturates capacity in noisy channels.
The schemes outperform classical limits in covert communication.
Receivers for optimal hypothesis testing and phase estimation are constructed.
Abstract
Entanglement offers substantial advantages in quantum information processing, but loss and noise hinder its applications in practical scenarios. Although it has been well known for decades that the classical communication capacity over lossy and noisy bosonic channels can be significantly enhanced by entanglement, no practical encoding and decoding schemes are available to realize any entanglement-enabled advantage. Here, we report structured encoding and decoding schemes for such an entanglement-assisted communication scenario. Specifically, we show that phase encoding on the entangled two-mode squeezed vacuum state saturates the entanglement-assisted classical communication capacity over a very noisy channel and overcomes the fundamental limit of covert communication without entanglement assistance. We then construct receivers for optimum hypothesis testing protocols under discrete…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
