Classical Capacity of Single-Mode Bosonic Gaussian Channels
Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti
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 ε equals the vanishing-error capacity at mean photon number N/(1-ε). Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.
Create a lesson
Related papers
Discovering state-of-the-art quantum circuits with large language models
Andi Gu, Alek H. Kemeny, Susanne F. Yelin et al.
Stability of Quantum LDPC States under Local Pauli Noise
Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay et al.
Magic in quantum trajectory unravelings of noisy random quantum circuits
Sara Santos, Alessio Paviglianiti, Vincenzo Savona
Magna: simulating magic state factories as cheaply as Clifford circuits
Yifei Wang, Yingfei Gu
SynDebug: A Framework to Debug Logic Bugs in Fault-Tolerant Quantum Computing Programs
Nicholas S. DiBrita, Jack Lange, Tirthak Patel
Constrained dissipation and the lifetime of quantum many-body scars
Weyner Ccuiro, Rosario Fazio, Alessandro Silva