Skip to content
Preprint

Classical Capacity of Single-Mode Bosonic Gaussian Channels

Oct 2026 · 0 citations · 48 references
Physics Mathematics

Abstract

The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number $N$ and allowed average decoding error $\epsilon$ equals the vanishing-error capacity at mean photon number $N/(1-\epsilon)$. Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.

View source

Similar papers

Preprint Sep 2026

Strong converse for the quantum capacity of the pure-loss bosonic channel

This paper reports the proof of a strong converse for the unconstrained quantum capacity of the pure-loss bosonic channel. At every fixed rate above capacity, the entanglement-generation fidelity of every code is bounded by a constant times the reciprocal of the number of channel uses. The bound holds without an energy...

M. Wilde · 2 citations
Preprint Oct 2026

Energy-constrained two-way capacity bounds for noisy Gaussian channels

A gap between achievable rates and converse bounds persists for energy-constrained bosonic communication in the presence of excess noise. We derive a unified adaptive weak-converse bound for thermal attenuation, noisy amplification, and additive Gaussian noise under an unconditional mean transmitted-photon-number const...

S. Pirandola · 2 citations
Preprint Oct 2026

Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels

While the ultimate limits on the rate of quantum communication over noisy channels are well-established, very few efficient coding schemes achieving these limits are known. This contrasts sharply with transmitting classical data over classical channels, where polar codes and low-density parity-check codes both efficien...

Avijit Mandal, C. Piveteau, Henry D. Pfister et al. · 0 citations
Preprint Oct 2026

PPT-assisted capacities of bosonic Gaussian channels

We determine the exact quantum communication and entanglement-distribution capacities of three fundamental bosonic channels, namely thermal loss, thermal amplification and additive Gaussian noise, assisted by operations that completely preserve positive partial transpose (PPT). These operations are more powerful than l...

M. Barber, S. Pirandola · 0 citations
Preprint Sep 2026

Classical Capacity and Entanglement Cost of the Amplitude Damping Channel

Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel ent...

Ziao Tang, Cheng-Kai Zhu, Ge Bai et al. · 2 citations · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.