Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2502.05524 · IEEE Transactions on Information Theory

Achievable Rates in Non-Asymptotic Bosonic Quantum Communication

Francesco Anna Mele, Giovanni Barbarino, Vittorio Giovannetti, Marco Fanizza

Published Jan 1, 2026• 14 citations
arXivHTMLPDF

Abstract

Bosonic quantum communication has extensively been analysed in the asymptotic setting, assuming infinite channel uses and vanishing communication errors. Comparatively fewer detailed analyses are available in the non-asymptotic setting, which addresses a more precise, quantitative evaluation of the optimal communication rate: how many uses of a bosonic Gaussian channel are required to transmit $k$ qubits, distil $k$ Bell pairs, or generate $k$ secret-key bits, within a given error tolerance $\varepsilon$? In this work, we address this question by finding easily computable lower bounds on the non-asymptotic capacities of Gaussian channels. To derive our results, we develop new tools of independent interest. In particular, we find a stringent bound on the probability $P_{>N}$ that a Gaussian state has more than $N$ photons, demonstrating that $P_{>N}$ decreases exponentially with $N$. Furthermore, we design the first algorithm capable of computing the trace distance between two Gaussian states up to a fixed precision.

DOI
10.1109/tit.2026.3744994

Related papers

Classical Capacity of Single-Mode Bosonic Gaussian Channels

Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti

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.

quant-pharXiv:2610.22308•Oct 16, 2026•1 citation

Bosonic quantum communication beyond the thermal threshold

Francesco Anna Mele, Giuseppe Catalano, Marco Fanizza +2 more

The quantum capacity of the bosonic thermal attenuator, which is given by the regularization of its coherent information, is unknown. The seminal work of Holevo and Werner established in 1999 the standard one-use lower bound obtained from input thermal states. We first prove that this long-standing lower bound is the exact supremum over all single-mode Gaussian states and then show that, crucially, a non-Gaussian state can do better. As a consequence, we prove positivity of the quantum capacity in a parameter region where the channel is not antidegradable, yet its coherent information optimized over single-mode Gaussian states vanishes. For example, with one thermal photon in the environment and at transmissivity $η=0.8$, the coherent information is non-positive for every single-mode Gaussian input. We give an explicit rank-two non-Gaussian state, supported on only six Fock levels, whose coherent information is certified to be at least $4.7\times10^{-4}$ qubits per channel use. This short witness is far from numerically optimal: a numerical optimization over fixed non-Gaussian families reaches at least $8.4\times 10^{-3}$ qubits per channel use at the same point. More generally, at $ν=1$, using non-Gaussian inputs we certify positivity of the coherent information, and therefore of the quantum capacity, down to $η=0.7841$; by contrast, the channel is antidegradable, and hence has zero quantum capacity, for $η\leq0.75$. Overall, our work identifies new high-noise regimes in which bosonic quantum communication is possible.

quant-pharXiv:2607.27449•Jul 31, 2026•1 citation

Lower Bounding the Secret Key Capacity of Bosonic Gaussian Channels via Optimal Gaussian Measurements

Giuseppe Ortolano, Stefano Pirandola, Leonardo Banchi

We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate capacity of the channel. We focus on the class of phase-insensitive Gaussian channels. For the thermal-loss and thermal amplification channels, our results demonstrate the optimality, within the constraints of our analysis, of previously proposed protocols, while also providing a significantly simplified formula for their performance evaluation. For the added noise channel, our rate provides a better lower bound than any previously known.

quant-pharXiv:2512.15502•Physical Review A•Dec 18, 2025•6 citations

Fault-Tolerant Coding for Quantum Communication

Matthias Christandl, Alexander Müller‐Hermes

Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error it is usually assumed that these circuits can be implemented using noise-free gates. While this assumption is satisfied for classical machines in many scenarios, it is not expected to be satisfied in the near term future for quantum machines where decoherence leads to faults in the quantum gates. As a result, fundamental questions regarding the practical relevance of quantum channel coding remain open. By combining techniques from fault-tolerant quantum computation with techniques from quantum communication, we initiate the study of these questions. We introduce fault-tolerant versions of quantum capacities quantifying the optimal communication rates achievable with asymptotically vanishing total error when the encoding and decoding circuits are affected by gate errors with small probability. Our main results are threshold theorems for the classical and quantum capacity: For every quantum channel$T$and every$\epsilon >0$there exists a threshold$p(\epsilon,T)$for the gate error probability below which rates larger than$C-\epsilon $are fault-tolerantly achievable with vanishing overall communication error, where$C$denotes the usual capacity. Our results are not only relevant in communication over large distances, but also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise than affecting the local gates.

arXiv:2009.07161•IEEE Transactions on Information Theory•Apr 21, 2022•20 citations

A universal energy–entanglement capacity frontier for Gaussian optical channels

Zixuan He

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 \(\Phi\) with finitely many input and output modes. Signal energy is measured by a positive quadratic Hamiltonian \(H_G=\tfrac12 R^{\mathsf T}GR\), with \(G>0\) and ground energy \(E_0\); \(R\) collects the canonical quadratures. The budgets satisfy \(E\ge E_0\) and \(P\ge0\). 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 \(K_n\) satisfying \(\log K_n\le 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)=\max_{\substack{U\ge V\;\mathrm{physical}\\ \frac12\operatorname{Tr}(GU)\le E,\;S_G(V)\le P}}\bigl[S_G(\Phi U)+S_G(V)-S_G(\Phi^c V)\bigr]. \] 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\Omega/2\ge0\), where \(\Omega\) is the canonical commutation matrix and the vacuum covariance is \(I/2\). The notation \(S_G\) denotes Gaussian von Neumann entropy, and \(\Phi^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\le\varepsilon<1\), the exact capacity under the mean-energy constraint is \[ C_\varepsilon(E,P)=C\!\left(E_0+\frac{E-E_0}{1-\varepsilon},\,P\right). \] 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<\eta<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 \(C_N(P)\), and define \(g(N)=(N+1)\log(N+1)-N\log N\). The gain from entanglement obeys the sharp bound \[ 0\le C_N(P)-C_N(0)\le\frac{\eta}{1+b}\,P. \] For every fixed \(N>0\), the coefficient \(\eta/(1+b)\) is attained as the initial right derivative at \(P=0\). In the low-photon limit, the stronger resource law is \[ C_N(P)-C_N(0)=\frac{\eta}{1+b}\min\{P,g(N)\}+O(N),\qquad N\downarrow0. \] The remainder is uniform over \(P\ge0\) at fixed \(\eta\) and positive \(b\). Noise therefore determines the conversion efficiency, while \(g(N)\sim N\log(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.

•Oct 19, 2026•0 citations

Tight bounds for private communication over bosonic Gaussian channels based on teleportation simulation with optimal finite resources

Riccardo Laurenza, Spyros Tserkis, Leonardo Banchi +3 more

Upper bounds for private communication over quantum channels can be derived by adopting channel simulation, protocol stretching, and relative entropy of entanglement. All these ingredients have led to single-letter upper bounds to the secret-key capacity which can be directly computed over suitable resource states. For bosonic Gaussian channels, the tightest upper bounds have been derived by employing teleportation simulation over asymptotic resource states, namely, the asymptotic Choi matrices of these channels. In this work, we adopt a different approach. We show that teleporting over an analytical class of finite-energy resource states allows us to closely approximate the ultimate bounds for increasing energy, so as to provide increasingly tight upper bounds to the secret-key capacity of one-mode phase-insensitive Gaussian channels. We then show that an optimization over the same class of resource states can be used to bound the maximum secret-key rates that are achievable in a finite number of channel uses.

arXiv:1808.00608•Physical Review A•Oct 1, 2019•15 citations
Bosonic quantum communication has extensively been analysed in the asymptotic setting, assuming infinite channel uses and vanishing communication errors. Comparatively fewer detailed analyses are available in the non-asymptotic setting, which addresses a more precise, quantitative evaluation of the optimal communication rate: how many uses of a bosonic Gaussian channel are required to transmit kkk qubits, distil kkk Bell pairs, or generate kkk secret-key bits, within a given error tolerance ε\varepsilonε? In this work, we address this question by finding easily computable lower bounds on the non-asymptotic capacities of Gaussian channels. To derive our results, we develop new tools of independent interest. In particular, we find a stringent bound on the probability P>NP_{>N}P>N​ that a Gaussian state has more than NNN photons, demonstrating that P>NP_{>N}P>N​ decreases exponentially with NNN. Furthermore, we design the first algorithm capable of computing the trace distance between two Gaussian states up to a fixed precision.
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 NNN and allowed average decoding error εεε equals the vanishing-error capacity at mean photon number N/(1−ε)N/(1-ε)N/(1−ε). Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.
The quantum capacity of the bosonic thermal attenuator, which is given by the regularization of its coherent information, is unknown. The seminal work of Holevo and Werner established in 1999 the standard one-use lower bound obtained from input thermal states. We first prove that this long-standing lower bound is the exact supremum over all single-mode Gaussian states and then show that, crucially, a non-Gaussian state can do better. As a consequence, we prove positivity of the quantum capacity in a parameter region where the channel is not antidegradable, yet its coherent information optimized over single-mode Gaussian states vanishes. For example, with one thermal photon in the environment and at transmissivity η=0.8η=0.8η=0.8, the coherent information is non-positive for every single-mode Gaussian input. We give an explicit rank-two non-Gaussian state, supported on only six Fock levels, whose coherent information is certified to be at least 4.7×10−44.7\times10^{-4}4.7×10−4 qubits per channel use. This short witness is far from numerically optimal: a numerical optimization over fixed non-Gaussian families reaches at least 8.4×10−38.4\times 10^{-3}8.4×10−3 qubits per channel use at the same point. More generally, at ν=1ν=1ν=1, using non-Gaussian inputs we certify positivity of the coherent information, and therefore of the quantum capacity, down to η=0.7841η=0.7841η=0.7841; by contrast, the channel is antidegradable, and hence has zero quantum capacity, for η≤0.75η\leq0.75η≤0.75. Overall, our work identifies new high-noise regimes in which bosonic quantum communication is possible.
We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate capacity of the channel. We focus on the class of phase-insensitive Gaussian channels. For the thermal-loss and thermal amplification channels, our results demonstrate the optimality, within the constraints of our analysis, of previously proposed protocols, while also providing a significantly simplified formula for their performance evaluation. For the added noise channel, our rate provides a better lower bound than any previously known.
Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error it is usually assumed that these circuits can be implemented using noise-free gates. While this assumption is satisfied for classical machines in many scenarios, it is not expected to be satisfied in the near term future for quantum machines where decoherence leads to faults in the quantum gates. As a result, fundamental questions regarding the practical relevance of quantum channel coding remain open. By combining techniques from fault-tolerant quantum computation with techniques from quantum communication, we initiate the study of these questions. We introduce fault-tolerant versions of quantum capacities quantifying the optimal communication rates achievable with asymptotically vanishing total error when the encoding and decoding circuits are affected by gate errors with small probability. Our main results are threshold theorems for the classical and quantum capacity: For every quantum channelTTTand everyϵ>0\epsilon >0ϵ>0there exists a thresholdp(ϵ,T)p(\epsilon,T)p(ϵ,T)for the gate error probability below which rates larger than$C-\epsilon arefault−tolerantlyachievablewithvanishingoverallcommunicationerror,whereare fault-tolerantly achievable with vanishing overall communication error, wherearefault−tolerantlyachievablewithvanishingoverallcommunicationerror,whereC$denotes the usual capacity. Our results are not only relevant in communication over large distances, but also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise than affecting the local gates.
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 Φ\PhiΦ with finitely many input and output modes. Signal energy is measured by a positive quadratic Hamiltonian HG=12RTGRH_G=\tfrac12 R^{\mathsf T}GRHG​=21​RTGR, with G>0G>0G>0 and ground energy E0E_0E0​; RRR collects the canonical quadratures. The budgets satisfy E≥E0E\ge E_0E≥E0​ and P≥0P\ge0P≥0. For an nnn-use code, the mean total signal energy is at most nEnEnE, while the same initially shared maximally entangled state has Schmidt rank KnK_nKn​ satisfying log⁡Kn≤nP\log K_n\le nPlogKn​≤nP. Thus PPP 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)=max⁡U≥Vphysical12Tr⁡(GU)≤E,SG(V)≤P[SG(ΦU)+SG(V)−SG(ΦcV)]. C(E,P)=\max_{\substack{U\ge V\;\mathrm{physical}\\ \frac12\operatorname{Tr}(GU)\le E,\;S_G(V)\le P}}\bigl[S_G(\Phi U)+S_G(V)-S_G(\Phi^c V)\bigr]. C(E,P)=maxU≥Vphysical21​Tr(GU)≤E,SG​(V)≤P​​[SG​(ΦU)+SG​(V)−SG​(ΦcV)]. Here VVV is a Gaussian seed covariance, UUU is the average-input covariance, and U−VU-VU−V is the displacement-modulation covariance. A covariance is physical when V+iΩ/2≥0V+i\Omega/2\ge0V+iΩ/2≥0, where Ω\OmegaΩ is the canonical commutation matrix and the vacuum covariance is I/2I/2I/2. The notation SGS_GSG​ denotes Gaussian von Neumann entropy, and Φc\Phi^cΦ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=0P=0P=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≤ε<10\le\varepsilon<10≤ε<1, the exact capacity under the mean-energy constraint is Cε(E,P)=C ⁣(E0+E−E01−ε, P). C_\varepsilon(E,P)=C\!\left(E_0+\frac{E-E_0}{1-\varepsilon},\,P\right). 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<η<10<\eta<10<η<1 be the transmissivity, b>0b>0b>0 the output mean photon number for vacuum input, and NNN the input mean photon number. Write its capacity as CN(P)C_N(P)CN​(P), and define g(N)=(N+1)log⁡(N+1)−Nlog⁡Ng(N)=(N+1)\log(N+1)-N\log Ng(N)=(N+1)log(N+1)−NlogN. The gain from entanglement obeys the sharp bound 0≤CN(P)−CN(0)≤η1+b P. 0\le C_N(P)-C_N(0)\le\frac{\eta}{1+b}\,P. 0≤CN​(P)−CN​(0)≤1+bη​P. For every fixed N>0N>0N>0, the coefficient η/(1+b)\eta/(1+b)η/(1+b) is attained as the initial right derivative at P=0P=0P=0. In the low-photon limit, the stronger resource law is CN(P)−CN(0)=η1+bmin⁡{P,g(N)}+O(N),N↓0. C_N(P)-C_N(0)=\frac{\eta}{1+b}\min\{P,g(N)\}+O(N),\qquad N\downarrow0. CN​(P)−CN​(0)=1+bη​min{P,g(N)}+O(N),N↓0. The remainder is uniform over P≥0P\ge0P≥0 at fixed η\etaη and positive bbb. Noise therefore determines the conversion efficiency, while g(N)∼Nlog⁡(1/N)g(N)\sim N\log(1/N)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−510^{-5}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.
Upper bounds for private communication over quantum channels can be derived by adopting channel simulation, protocol stretching, and relative entropy of entanglement. All these ingredients have led to single-letter upper bounds to the secret-key capacity which can be directly computed over suitable resource states. For bosonic Gaussian channels, the tightest upper bounds have been derived by employing teleportation simulation over asymptotic resource states, namely, the asymptotic Choi matrices of these channels. In this work, we adopt a different approach. We show that teleporting over an analytical class of finite-energy resource states allows us to closely approximate the ultimate bounds for increasing energy, so as to provide increasingly tight upper bounds to the secret-key capacity of one-mode phase-insensitive Gaussian channels. We then show that an optimization over the same class of resource states can be used to bound the maximum secret-key rates that are achievable in a finite number of channel uses.