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.
AI Summary
The paper determines the energy-constrained, unassisted classical capacity of every single-mode bosonic Gaussian channel, including phase-sensitive channels below the energy threshold where noise-matching squeezing and information-bearing displacements compete. It establishes $\chi(\Phi^{\otimes n},nN)=n\chi_G(\Phi,N)$ for every $n$ and $N$: independent Gaussian seeds with Gaussian-distributed displacements attain the unrestricted capacity, without improvement from non-Gaussian signals or entanglement across independent uses. Below threshold, the optimum uses a squeezed-vacuum seed displaced in one quadrature; above threshold, both quadratures are modulated.
The proof applies a previously established additive, many-pair affine entanglement inequality to Gaussian dilations, producing a sharp lower bound on joint output entropy in terms of input quadrature second moments. Convexity then bounds arbitrary ensembles and yields optimal energy allocation across heterogeneous links. Passive normal-mode reduction extends the result to correlated-noise models with commuting position and momentum noise matrices, with operational asymptotic results for a specified chain model.
The paper also determines the exact average-error capacity under an average mean-photon-number constraint: $C_\epsilon(\Phi,N)=C(\Phi,N/(1-\epsilon))$. Under a strict total photon-number cutoff, success instead decays exponentially at every rate above capacity, proved using energy-preserving filters and polynomial approximations.
The converse exponents are computable bounds, not claimed optimal. Low-energy capacities generally require transcendental optimisation. General multimode Gaussian capacities remain unevaluated; the broader converse applies at their regularised Holevo threshold. Growing memory blocks require additional uniform dilation and coding conditions, not merely a limiting noise spectrum.
Little sign of AI-generated text
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Comments
24 pages, 2 figures. See also related results for entanglement in https://arxiv.org/abs/2608.01909v3
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.
The paper determines the energy-constrained, unassisted classical capacity of every single-mode bosonic Gaussian channel, including phase-sensitive channels below the energy threshold where noise-matching squeezing and information-bearing displacements compete. It establishes χ(Φ⊗n,nN)=nχG(Φ,N) for every n and N: independent Gaussian seeds with Gaussian-distributed displacements attain the unrestricted capacity, without improvement from non-Gaussian signals or entanglement across independent uses. Below threshold, the optimum uses a squeezed-vacuum seed displaced in one quadrature; above threshold, both quadratures are modulated.
The proof applies a previously established additive, many-pair affine entanglement inequality to Gaussian dilations, producing a sharp lower bound on joint output entropy in terms of input quadrature second moments. Convexity then bounds arbitrary ensembles and yields optimal energy allocation across heterogeneous links. Passive normal-mode reduction extends the result to correlated-noise models with commuting position and momentum noise matrices, with operational asymptotic results for a specified chain model.
The paper also determines the exact average-error capacity under an average mean-photon-number constraint: Cϵ(Φ,N)=C(Φ,N/(1−ϵ)). Under a strict total photon-number cutoff, success instead decays exponentially at every rate above capacity, proved using energy-preserving filters and polynomial approximations.
The converse exponents are computable bounds, not claimed optimal. Low-energy capacities generally require transcendental optimisation. General multimode Gaussian capacities remain unevaluated; the broader converse applies at their regularised Holevo threshold. Growing memory blocks require additional uniform dilation and coding conditions, not merely a limiting noise spectrum.
How much classical information can a noisy optical channel carry when both signal energy and preshared entanglement are limited? This work gives an exact capacity frontier for this joint resource problem. It allows one to determine the best asymptotic communication rate, price the benefit of additional entanglement, and distinguish the effect of tolerating errors from that of changing how entanglement is supplied. Exact capacity under two resource constraints The setting is any fixed bosonic Gaussian channel Φ with finitely many input and output modes. Signal energy is measured by a positive quadratic Hamiltonian HG=21RTGR, with G>0 and ground energy E0; R collects the canonical quadratures. The budgets satisfy E≥E0 and P≥0. For an n-use code, the mean total signal energy is at most nE, while the same initially shared maximally entangled state has Schmidt rank Kn satisfying logKn≤nP. Thus P is a strictly supplied entanglement rate. Encoders may be arbitrary joint quantum operations, and decoding may be collective. The classical capacity is C(E,P)=maxU≥Vphysical21Tr(GU)≤E,SG(V)≤P[SG(ΦU)+SG(V)−SG(ΦcV)]. Here V is a Gaussian seed covariance, U is the average-input covariance, and U−V is the displacement-modulation covariance. A covariance is physical when V+iΩ/2≥0, where Ω is the canonical commutation matrix and the vacuum covariance is I/2. The notation SG denotes Gaussian von Neumann entropy, and Φc is the full complementary channel, including any environment purification. All logarithms are natural, so rates are in nats per channel use. This formula replaces optimization over arbitrary quantum block codes by a finite-dimensional covariance optimization. It supplies both an achievable rate and a converse against non-Gaussian, correlated encodings. At P=0, it also determines the unassisted capacity of general fixed finite-mode Gaussian channels, including channels without a passive decomposition into independent modes. The reduction specifies the exact capacity value; it does not require a closed-form optimizer for every device. Energy and strict entanglement supply respond differently to errors For a fixed allowed average error 0≤ε<1, the exact capacity under the mean-energy constraint is Cε(E,P)=C(E0+1−εE−E0,P). Allowing failure rescales the mean energy above the ground state, but leaves the strict initial entanglement budget unchanged. The proof uses an exponential strong converse for codes whose inputs obey a hard total-energy cutoff. In a different model, where a readable flag permits random entanglement supply constrained only on average, the work establishes an achievable bound and a strict small-supply advantage for thermal attenuation at positive energy and fixed nonzero error. That comparison identifies the operational importance of the supply rule; it is not a complete capacity characterization of the flagged model. The communication value of entanglement For a thermal attenuator, let 0<η<1 be the transmissivity, b>0 the output mean photon number for vacuum input, and N the input mean photon number. Write its capacity as CN(P), and define g(N)=(N+1)log(N+1)−NlogN. The gain from entanglement obeys the sharp bound 0≤CN(P)−CN(0)≤1+bηP. For every fixed N>0, the coefficient η/(1+b) is attained as the initial right derivative at P=0. In the low-photon limit, the stronger resource law is CN(P)−CN(0)=1+bηmin{P,g(N)}+O(N),N↓0. The remainder is uniform over P≥0 at fixed η and positive b. Noise therefore determines the conversion efficiency, while g(N)∼Nlog(1/N) sets the entanglement scale sufficient for saturation. This uniform limit concerns the entanglement budget, not a simultaneous limit of vanishing thermal noise. Multimode resource allocation and scope A coupled two-mode example demonstrates how the frontier can guide resource allocation. A global resource-price certificate proves that a legal covariance pair exceeds the entire common-passive-frame Gaussian profile hull by at least 10−5 nat per two-mode use at specified budgets. The comparison includes all common passive frames, local squeezing and average-resource mixtures. The mechanism is the freedom to choose different mode allocations for the seed and average input; the benchmark is this precisely defined Gaussian class, rather than all unentangled encodings. The universal scope is the stated family of fixed finite-mode Gaussian channels, positive quadratic signal costs and strict initial maximally entangled Schmidt-rank supply, with unrestricted joint encoding and collective decoding. The model has no feedback or credit for returned entanglement. The capacity frontier and its resource consequences provide a common way to assess optical communication designs under these operational constraints.
A long-standing problem on the classical capacity of bosonic Gaussian channels has recently been resolved by proving the minimum output entropy conjecture. It is also known that the ultimate capacity quantified by the Holevo bound can be achieved asymptotically by using an infinite number of channels. However, it is less understood to what extent the communication capacity can be reached if one uses a finite number of channels, which is a topic of practical importance. In this paper, we study the capacity of Gaussian communication, i.e., employing Gaussian states and Gaussian measurements to encode and decode information under a single-channel use. We prove that the optimal capacity of single-channel Gaussian communication is achieved by one of two well-known protocols, i.e., coherent-state communication or squeezed-state communication, depending on the energy (number of photons) as well as the characteristics of the channel. Our result suggests that the coherent-state scheme known to achieve the ultimate information-theoretic capacity is not a practically optimal scheme for the case of using a finite number of channels. We find that overall the squeezed-state communication is optimal in a small-photon-number regime whereas the coherent-state communication performs better in a large-photon-number regime.
In this thesis we study the information transmission through Gaussian quantum channels. Gaussian quantum channels model physical communication links, such as free space communication or optical fibers and therefore, may be considered as the most relevant quantum channels. One of the central characteristics of any communication channel is its capacity. In this work we are interested in the classical capacity, which is the maximal number of bits that can be reliably transmitted per channel use. An important lower bound on the classical capacity is given by the Gaussian capacity, which is the maximal transmission rate with the restriction that only Gaussian encodings are allowed: input messages are encoded in so-called Gaussian states for which the mean field amplitudes are Gaussian distributed. We focus in this work mainly on the Gaussian capacity for the following reasons. First, Gaussian encodings are easily accessible experimentally. Second, the difficulty of studying the classical capacity, which arises due to an optimization problem in an infinite dimensional Hilbert space, is greatly reduced when considering only Gaussian input encodings. Third, the Gaussian capacity is conjectured to coincide with the classical capacity, even though this longstanding conjecture is unsolved until today. We start with the investigation of the capacities of the single-mode Gaussian channel. We show that the most general case can be reduced to a simple, fiducial Gaussian channel which depends only on three parameters: its transmissivity (or gain), the added noise variance and the squeezing of the noise. Above a certain input energy threshold, the optimal input variances are given by a quantum water-filling solution, which implies that the optimal modulated output state is a thermal state. This is a quantum extension (or generalization) of the well-known classical water-filling solution for parallel Gaussian channels. Below the energy threshold the solution is given by a transcendental equation and only the less noisy quadrature is modulated. We characterize in detail the dependence of the Gaussian capacity on its channel parameters. In particular, we show that the Gaussian capacity is a non-monotonous function of the noise squeezing and analytically specify the regions where it exhibits one maximum, a maximum and a minimum, a saddle point or no extrema. Then, we investigate the case of n-mode channels with noise correlations (i.e. memory), where we focus in particular on the classical additive noise channel. We consider memory models for which the noise correlations can be unraveled by a passive symplectic transformation. Therefore, we can simplify the problem to the study of the Gaussian capacity in an uncorrelated basis, which corresponds to the Gaussian capacity of n single-mode channels with a common input energy constraint. Above an input energy threshold the solutions is given by a global quantum water-filling solution, which implies that all modulated single-mode output states are thermal states with the same temperature. Below the threshold the channels are divided into three sets: i) those that are excluded from information transmission, ii) those for which only the less noisy quadrature is modulated, and iii) those for which the quantum water-filling solution is satisfied. As an example we consider a Gauss-Markov correlated noise, which in the uncorrelated basis corresponds to a collection of single-mode classical additive noise channels. When rotating the collection of optimal single-mode input states back to the original, correlated basis the optimal multi-mode input state becomes a highly entangled state. We then compare the performance of the optimal input state with a simple coherent state encoding and conclude that one gains up to 10% by using the optimal encoding. Since the preparation of the optimal input state may be very challenging we consider sub-optimal Gaussian-matrix product states (GMPS) as input states as well. GMPS have a known experimental setup and, though being heavily entangled, can be generated sequentially. We demonstrate that for the Markovian correlated noise as well as for a non-Markovian noise model in a wide range of channel parameters, a nearest-neighbor correlated GMPS achieves more than 99.9% of the Gaussian capacity. At last, we introduce a new noise model for which the GMPS is the exact optimal input state. Since GMPS are known to be ground states of quadratic Hamiltonians this suggests a starting point to develop links between optimization problems of quantum communication and many body physics.
We prove Gaussian optimality for the energy-constrained one-shot Holevo capacity of single-mode bosonic Gaussian channels, including phase-sensitive channels with arbitrarily squeezed thermal noise. The unresolved regime is the low energy branch, where the Gaussian optimizer modulates only one quadrature and minimum-output-entropy arguments cannot decouple the average state from the letters. For pure one-mode dilations we retain a stronger pointwise result: moment-matched Gaussianization improves the fixed average Holevo function for every input. For mixed environments, whose purification produces a 1:2 entanglement-of-formation problem, we avoid any generic 1:2 Gaussian extremality conjecture. The optimal Gaussian letter selects an effective environmental Schmidt mode and an affine two-mode EPR witness. Its null direction is exactly the modulated quadrature, while its slope equals the negative derivative of the Gaussian letter-output entropy. This produces a supporting lower bound on the dilated entanglement of formation; Gaussian maximum entropy and concavity then give a global upper bound tangent at the Gaussian optimizer. Consequently the known Gaussian formulas for attenuating, amplifying, phase-conjugating, and additive-noise fiducial channels are exact over unrestricted ensembles at every input energy. Via the passive-input fiducial decomposition and energy-constrained continuity, the result extends to every single-mode Gaussian channel, including lower-rank canonical limits. No additivity across channel uses is assumed.
We establish the classical capacity of optical quantum channels as a sharp transition between two regimes-one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly decoding a classical message converges exponentially fast to zero if the communication rate exceeds the classical capacity. This result is obtained by proving a strong converse theorem for the classical capacity of all phase-insensitive bosonic Gaussian channels, a well-established model of optical quantum communication channels, such as lossy optical fibers, amplifier, and free-space communication. The theorem holds under a particular photon-number occupation constraint, which we describe in detail in this paper. Our result bolsters the understanding of the classical capacity of these channels and opens the path to applications, such as proving the security of noisy quantum storage models of cryptography with optical links.
Directional optical noise makes photons pay for both squeezing and signal modulation. This paper determines the optimal transmitter and the ultimate classical communication rate, even when arbitrary entangled and non-Gaussian encodings across many channel uses are allowed. For a finite collection of independent squeezed thermal attenuators with different losses and noise covariances, the complete quantum optimization reduces exactly to a scalar allocation of the total mean photon budget. The result covers every input energy, including the low-energy regime in which only one quadrature should be modulated, channels receiving zero photons, and pure squeezed environments. 1. Exact capacity and all-block additivity. Let Φ=⨂j=1dΦj, let E≥0 be the total average input photon number per block, and let Cj(Ej) be the explicitly attained one-channel rate specified in the paper. Then C(Φ,E)=χΦ(E)=maxEj≥0,∑jEj≤E∑j=1dCj(Ej),χΦ⊗n(nE)=nC(Φ,E)(n≥1). The optimization includes arbitrary joint input ensembles, with an average physical photon constraint and unrestricted decoding. Independent Gaussian modulation of pure squeezed states attains the answer. Thus neither non-Gaussian codewords nor entanglement across the specified independent channels or repeated blocks improves the capacity. Information quantities use natural logarithms; division by ln2 gives bits. 2. From measured channel noise to a transmitter design. In quadratures with vacuum covariance I/2, each channel acts as V↦ηV+diag(yq,yp), where 0<η<1, yq≥yp>0, and yqyp≥(1−η)2/4. Define ue=21ypyq,Eth=ue−21+2ηyq−yp. Below this threshold, a bounded one-dimensional maximization determines the optimal seed squeezing and the modulation of the quieter quadrature. Above it, both quadratures can be modulated and the average output is isotropic. Writing g(x)=(x+1)ln(x+1)−xlnx, the high-energy rate is Cj(E)=g(ηE+2η+yq+yp−1)−g(2η+yqyp−21),E≥Eth. Both seed squeezing and signal modulation are charged to the same physical input budget. The manuscript gives the low-energy variational formula and the attaining covariances explicitly. 3. When should another channel receive photons? The one-channel capacity curves are increasing and concave. For strictly mixed environments, the optimal allocation equalizes marginal information gains: Cj′(Ej∗)=λ(Ej∗>0),Cj′(0+)≤λ(Ej∗=0). A previously unused channel turns on when its initial information gain becomes competitive with the declining gain of the channels already in use. Pure-environment endpoints follow by continuity of the attained capacity. In the two-channel example in Figure 1, the second channel activates at total budget approximately E=0.436 photons. The figures evaluate the analytic allocation law and display how photons divide between squeezing, modulation and different links. 4. A converse for the complete correlated input. A joint quadratic output-entropy support excludes all competing encodings. Its proof develops a sharp thermal-reference contraction using both Bogoliubov orientations and independently adjusted thermal references. The appendix supplies the regularized minimizer, Gibbs identity, full-state Hessian comparison, interpolation domains, residual propagation and limiting arguments. This connects a computable Gaussian transmitter design to a bound on every allowed quantum code. Use and scope. Communication theorists and optical-source designers can use measured loss and quadrature noise to allocate a common photon budget, choose the seed squeezing and modulation, identify inactive channels, and calculate an attained capacity benchmark for these memoryless channels. The all-energy result addresses the low-energy Holevo additivity question for a squeezed thermal attenuator, and extends it to heterogeneous finite products under one total budget. Version 1.0, 13 October 2026. The 16-page PDF contains the article, two vector figures, complete supplementary proofs and references.