Second-order coding rates for pure-loss bosonic channels
Mark M. Wilde, Joseph M. Renes, and Saikat Guha

TL;DR
This paper investigates the second-order coding rates for pure-loss bosonic channels, providing bounds on achievable code sizes and advancing understanding of finite-blocklength communication limits in quantum optical systems.
Contribution
It introduces a one-shot coding theorem for channels with classical inputs and pure-state quantum outputs, and derives a lower bound on the second-order coding rate for pure-loss bosonic channels.
Findings
Lower bound on achievable code size for pure-loss bosonic channels
Connection between second-order rates and channel dispersion
Extension of one-shot coding theorems to quantum channels
Abstract
A pure-loss bosonic channel is a simple model for communication over free-space or fiber-optic links. More generally, phase-insensitive bosonic channels model other kinds of noise, such as thermalizing or amplifying processes. Recent work has established the classical capacity of all of these channels, and furthermore, it is now known that a strong converse theorem holds for the classical capacity of these channels under a particular photon number constraint. The goal of the present paper is to initiate the study of second-order coding rates for these channels, by beginning with the simplest one, the pure-loss bosonic channel. In a second-order analysis of communication, one fixes the tolerable error probability and seeks to understand the back-off from capacity for a sufficiently large yet finite number of channel uses. We find a lower bound on the maximum achievable code size for the…
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.
