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

Finite-blocklength limits of the pure-loss bosonic channel

Zixuan He

Published Sep 22, 2026• 0 citations
Publisher

Abstract

We determine the finite-blocklength asymptotics of classical communication over the pure-loss bosonic channel under a maximum-photon-number occupation constraint. Wilde, Renes and Guha previously derived a second-order achievable rate governed by thermal photon-number fluctuations and left its optimality open. We show that fixed-total-photon-number encoding removes input-number fluctuations while preserving the first-order capacity, leaving binomial photon-survival fluctuations as the operational second-order contribution. For fixed transmissivity 0 < η < 1, signal photon number NS > 0, and error probability 0 < ε < 1, we determine the optimal fixed-error expansion through third order. The operational dispersion is Vsh = η(1 − η)NS [log2(1 + 1/(ηNS))]^2, and the optimal code size contains the third-order correction −(1/2)log2 n up to a bounded O(1) remainder. The achievability construction uses fixed-photon-number shell codes, while the converse applies to arbitrary multimode quantum encodings and arbitrary joint decoding measurements within the stated occupation constraint. This Zenodo record contains the preprint, LaTeX source, vector figures, source data, and reproducibility code used for the numerical checks and figure generation.

DOI
10.5281/zenodo.22893614

Related papers

Second-order coding rates for pure-loss bosonic channels

Mark M. Wilde, Joseph M. Renes, Saikat Guha

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 pure-loss bosonic channel, in terms of the known expression for its capacity and a quantity called channel dispersion. We accomplish this by proving a general “one-shot” coding theorem for channels with classical inputs and pure-state quantum outputs which reside in a separable Hilbert space. The theorem leads to an optimal second-order characterization when the channel output is finite-dimensional, and it remains an open question to determine whether the characterization is optimal for the pure-loss bosonic channel.

Civil War Book Review•Mar 1, 2016•16 citations

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

Mark M. Wilde, Andreas Winter

This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in [1]. In particular, we first prove that there exists a trade-off between communication rate and error probability if one imposes only a mean photon number constraint on the channel inputs. That is, if we demand that the mean number of photons at the channel input cannot be any larger than some positive number NS , then it is possible to respect this constraint with a code that operates at a rate g ( ηNS /(1- p )) where p is the code error probability, η is the channel transmissivity, and g ( x ) is the entropy of a bosonic thermal state with mean photon number x . Then we prove that a strong converse theorem holds for the classical capacity of this channel (that such a rate-error trade-off cannot occur) if one instead demands for a maximum photon number constraint, in such a way that mostly all of the “shadow” of the average density operator for a given code is required to be on a subspace with photon number no larger than nNS , so that the shadow outside this subspace vanishes as the number n of channel uses becomes large. Finally, we prove that a small modification of the well-known coherent-state coding scheme meets this more demanding constraint.

arXiv:1308.6732•Problems of Information Transmission•Apr 1, 2014•29 citations

Classical communication with an exact photon budget: finite-block limits and optimal input ensembles

Zixuan He

What can be transmitted with a fixed photon supply? An optical source that supplies exactly K photons across n modes poses a concrete communication problem: how many messages can it transmit at a chosen error probability, and which input states make the best use of those photons? This paper gives directly evaluable coding bounds for pure loss and identifies the exact optimal input ensembles for identical noisy Gaussian channels. The results allow researchers to assess finite optical blocks, quantify the information cost of fixing the photon supply, and determine when entanglement between separately constrained blocks can be dispensed with. Every message is supported on the same exact K-photon sector. Within that sector, encoding may use arbitrary mixed states and entanglement among modes, and the receiver may perform a joint measurement. Communication is unassisted. All logarithms below are natural; information is measured in nats. Finite-message bounds and the optimal third-order rate For n ≥ 2 identical pure-loss channels of transmissivity 0 < η < 1 and K ≥ 1, the number L of surviving photons has the same binomial distribution for every encoded state. Define \[p_\ell=\binom K\ell\eta^\ell(1-\eta)^{K-\ell},\qquad d_{n,\ell}=\binom{n+\ell-1}{\ell}.\] If ps*(M;n,K) is the best average success probability for M equiprobable messages, then \[\sum_{\ell=0}^{K}p_\ell\left[1-\frac{M-1}{d_{n,\ell}}\right]_+\le p_{\mathrm s}^{*}(M;n,K)\le\sum_{\ell=0}^{K}p_\ell\min\!\left\{1,\frac{d_{n,\ell}}{M}\right\}.\] Here [x]+ = max{x,0}. The lower bound provides an achievable guarantee; the upper bound limits every admissible code. Evaluating both sums brackets the performance at a specified photon supply and block length. Their proof has a simple physical interpretation: surviving photons determine the available output dimension, while one collective-mode codebook works across all possible survivor counts. For fixed E > 0, fixed error tolerance 0 < ε < 1, Kn = ⌊nE⌋ and en = Kn/n, the bounds determine the largest message count through third order: \[\log M^*(n,K_n,\varepsilon)=ng(\eta e_n)+\sqrt{n\eta(1-\eta)e_n}\,h(\eta e_n)\Phi_{\mathrm N}^{-1}(\varepsilon)-\tfrac12\log n+O(1).\] Here g(x) = (x+1)log(x+1) − x log x, h(x) = log(1+1/x), and ΦN is the standard normal distribution function. This fixes both the fluctuation scale and the optimal −½ log n correction. The finite bounds also yield the exact decay exponent of success above capacity and a matching error exponent on a specified interval below capacity. Which inputs are optimal under Gaussian noise? For n identical nonidentity gauge-covariant Gaussian channels, with thermal photon means transformed as r ↦ ar+b, a > 0 and b ≥ max{0,a−1}, the paper determines the exact fixed-photon Holevo optimum and every ensemble attaining it. Each optimal letter places all K photons in one collective mode: \[|K,u\rangle=\frac{\left(\sum_{j=1}^{n}u_j a_j^\dagger\right)^K}{\sqrt{K!}}|0\rangle,\qquad \sum_j|u_j|^2=1.\] An ensemble is optimal precisely when almost all its letters have this form and its average is uniform on the K-photon sector. A finite weighted optimal ensemble exists. These collective modes may themselves extend across, and be entangled among, physical optical modes. Thus the characterization identifies the structure to optimize without imposing a Gaussian-input restriction. The central proof step combines different loss histories that end in the same output photon sector. A common ordering of the comparison eigenstates allows the separate majorization bounds to be combined. For pure loss, a quantitative rigidity estimate further converts a small Holevo deficit into closeness to collective-mode number states. Resource cost and communication across blocks At fixed positive photon density and fixed nonidentity Gaussian noise, requiring an exact photon supply incurs a Holevo penalty of ½ log n plus an explicitly determined constant, relative to the usual mean-energy value. The paper separates this cost into photon-count uncertainty and the mismatch from a thermal output distribution. For separately constrained blocks of quantum-limited loss, quantum-limited amplification or entanglement-breaking Gaussian noise, the one-block Holevo values add exactly. Every optimal letter is a product of blockwise collective-mode number states, and the repeated-block unassisted classical capacity equals the one-block Holevo value. The low-rate reliability interval outside the matching range and repeated-block additivity for intermediate Gaussian noise remain open.

•Oct 13, 2026•0 citations

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

Mark M. Wilde

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 constraint and for arbitrary encoded states, including states correlated across all input modes, and arbitrary joint decoders. The proof combines quantum Chebyshev and hockey-stick testing inequalities with a uniform relative-entropy-variance bound for the balanced pure-loss channel, corresponding to transmissivity $η=1/2$. The variance bound follows by expressing the balanced beam splitter in bright and dark modes: the dark modes are exactly in vacuum, and any state orthogonal to that vacuum contains at least one dark photon. For general transmissivity, dilating the degrading attenuator reduces the problem to this balanced-channel setting and bounds the decoder test by precisely the factor that produces the known quantum-capacity threshold. The resulting argument establishes the strong converse at the unconstrained quantum capacity for every pure-loss bosonic channel.

quant-pharXiv:2609.16608•Sep 16, 2026•3 citations

Energy-constrained two-way capacities of pure-loss and quantum-limited amplifier channels

Stefano Pirandola

We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity $η$ and mean photon number $N$, all four capacities coincide and are given by $g(N)-g((1-η)N)$, where $g$ is the entropy of a thermal mode. This resolves the longstanding energy-constrained capacity problem by establishing the optimality of the reverse-coherent-information rate introduced in 2009. Our central tool is sector teleportation simulation, which we develop specifically to transfer the input-energy constraint to the shared entanglement resource, thereby preserving the constraint throughout converse arguments for general adaptive protocols. For every $N>0$, we further show that the corresponding strong-converse thresholds coincide with the unconstrained value $-\log_2(1-η)$. For parallel protocols with a hard total-photon-number cutoff, the same energy-constrained capacity formula instead satisfies an exponential strong converse. As an extension, we determine the energy-constrained two-way capacities of the quantum-limited amplifier, showing that classical assistance does not improve its unassisted quantum and private rates. Together, these results establish a unified finite-energy framework for adaptive bosonic communication and reveal how energy constraints fundamentally reshape both attainable rates and converse bounds.

quant-pharXiv:2610.06832•Oct 6, 2026•7 citations

Optimal two-mode bosonic loss codes from finite group symmetry

Argyris Giannisis Manes, Mahadevan Subramanian, Liang Jiang

Photon loss is a dominant noise process in bosonic quantum hardware, including superconducting cavities. Fixed-total-photon-number qubit encodings in two bosonic modes retain the loss-detection advantage of dual-rail qubits while supporting photon loss correction. Optimizing entanglement fidelity in this setting for $4\leq n\leq25$ over arbitrary encoders and decoders reveals finite-group structure in every best-found code: 11 correspond to two-dimensional irreducible representations and 11 to reducible ones. Motivated by this emergence, we derive the necessary-and-sufficient Knill-Laflamme conditions for arbitrary finite-group-invariant codes, reducing their construction to equations on representation multiplicity spaces. For every finite subgroup of $SU(2)$ and every tensor rank, we explicitly construct the minimum number of operators required to impose all corresponding loss-correction constraints. These results produce analytic counterparts to most numerical codes and predict constructions missed by the initial search. Exact MacWilliams-Farkas certificates show that our codes achieve the maximum possible loss distance in 21 of the 22 sectors, and we prove that the resulting distance bound is monotone in total photon number. Beyond the scan, we identify a binary-polyhedral sequence with photon number $n_d=\lceil(3d^2+1)/4\rceil$ and construct each corresponding code through distance $d=10$. To our knowledge, the constructed $(n,d)=(28,6),(49,8),(76,10)$ codes give the smallest reported $n$ for their respective distances; all members through $d=9$ attain the fixed-$n$ LP distance bound. Together, these constructions, certificates, and a symmetry-reduced constraint count provide evidence for an infinite code family conjectured to attain every distance at the minimum photon number.

quant-pharXiv:2610.00561•Oct 2, 2026•1 citation
We determine the finite-blocklength asymptotics of classical communication over the pure-loss bosonic channel under a maximum-photon-number occupation constraint. Wilde, Renes and Guha previously derived a second-order achievable rate governed by thermal photon-number fluctuations and left its optimality open. We show that fixed-total-photon-number encoding removes input-number fluctuations while preserving the first-order capacity, leaving binomial photon-survival fluctuations as the operational second-order contribution. For fixed transmissivity 0 < η < 1, signal photon number NS > 0, and error probability 0 < ε < 1, we determine the optimal fixed-error expansion through third order. The operational dispersion is Vsh = η(1 − η)NS [log2(1 + 1/(ηNS))]^2, and the optimal code size contains the third-order correction −(1/2)log2 n up to a bounded O(1) remainder. The achievability construction uses fixed-photon-number shell codes, while the converse applies to arbitrary multimode quantum encodings and arbitrary joint decoding measurements within the stated occupation constraint. This Zenodo record contains the preprint, LaTeX source, vector figures, source data, and reproducibility code used for the numerical checks and figure generation.
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 pure-loss bosonic channel, in terms of the known expression for its capacity and a quantity called channel dispersion. We accomplish this by proving a general “one-shot” coding theorem for channels with classical inputs and pure-state quantum outputs which reside in a separable Hilbert space. The theorem leads to an optimal second-order characterization when the channel output is finite-dimensional, and it remains an open question to determine whether the characterization is optimal for the pure-loss bosonic channel.
This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in [1]. In particular, we first prove that there exists a trade-off between communication rate and error probability if one imposes only a mean photon number constraint on the channel inputs. That is, if we demand that the mean number of photons at the channel input cannot be any larger than some positive number NS , then it is possible to respect this constraint with a code that operates at a rate g ( ηNS /(1- p )) where p is the code error probability, η is the channel transmissivity, and g ( x ) is the entropy of a bosonic thermal state with mean photon number x . Then we prove that a strong converse theorem holds for the classical capacity of this channel (that such a rate-error trade-off cannot occur) if one instead demands for a maximum photon number constraint, in such a way that mostly all of the “shadow” of the average density operator for a given code is required to be on a subspace with photon number no larger than nNS , so that the shadow outside this subspace vanishes as the number n of channel uses becomes large. Finally, we prove that a small modification of the well-known coherent-state coding scheme meets this more demanding constraint.
What can be transmitted with a fixed photon supply? An optical source that supplies exactly K photons across n modes poses a concrete communication problem: how many messages can it transmit at a chosen error probability, and which input states make the best use of those photons? This paper gives directly evaluable coding bounds for pure loss and identifies the exact optimal input ensembles for identical noisy Gaussian channels. The results allow researchers to assess finite optical blocks, quantify the information cost of fixing the photon supply, and determine when entanglement between separately constrained blocks can be dispensed with. Every message is supported on the same exact K-photon sector. Within that sector, encoding may use arbitrary mixed states and entanglement among modes, and the receiver may perform a joint measurement. Communication is unassisted. All logarithms below are natural; information is measured in nats. Finite-message bounds and the optimal third-order rate For n ≥ 2 identical pure-loss channels of transmissivity 0 < η < 1 and K ≥ 1, the number L of surviving photons has the same binomial distribution for every encoded state. Define pℓ=(Kℓ)ηℓ(1−η)K−ℓ,dn,ℓ=(n+ℓ−1ℓ).p_\ell=\binom K\ell\eta^\ell(1-\eta)^{K-\ell},\qquad d_{n,\ell}=\binom{n+\ell-1}{\ell}.pℓ​=(ℓK​)ηℓ(1−η)K−ℓ,dn,ℓ​=(ℓn+ℓ−1​). If ps*(M;n,K) is the best average success probability for M equiprobable messages, then ∑ℓ=0Kpℓ[1−M−1dn,ℓ]+≤ps∗(M;n,K)≤∑ℓ=0Kpℓmin⁡ ⁣{1,dn,ℓM}.\sum_{\ell=0}^{K}p_\ell\left[1-\frac{M-1}{d_{n,\ell}}\right]_+\le p_{\mathrm s}^{*}(M;n,K)\le\sum_{\ell=0}^{K}p_\ell\min\!\left\{1,\frac{d_{n,\ell}}{M}\right\}.∑ℓ=0K​pℓ​[1−dn,ℓ​M−1​]+​≤ps∗​(M;n,K)≤∑ℓ=0K​pℓ​min{1,Mdn,ℓ​​}. Here [x]+ = max{x,0}. The lower bound provides an achievable guarantee; the upper bound limits every admissible code. Evaluating both sums brackets the performance at a specified photon supply and block length. Their proof has a simple physical interpretation: surviving photons determine the available output dimension, while one collective-mode codebook works across all possible survivor counts. For fixed E > 0, fixed error tolerance 0 < ε < 1, Kn = ⌊nE⌋ and en = Kn/n, the bounds determine the largest message count through third order: log⁡M∗(n,Kn,ε)=ng(ηen)+nη(1−η)en h(ηen)ΦN−1(ε)−12log⁡n+O(1).\log M^*(n,K_n,\varepsilon)=ng(\eta e_n)+\sqrt{n\eta(1-\eta)e_n}\,h(\eta e_n)\Phi_{\mathrm N}^{-1}(\varepsilon)-\tfrac12\log n+O(1).logM∗(n,Kn​,ε)=ng(ηen​)+nη(1−η)en​​h(ηen​)ΦN−1​(ε)−21​logn+O(1). Here g(x) = (x+1)log(x+1) − x log x, h(x) = log(1+1/x), and ΦN is the standard normal distribution function. This fixes both the fluctuation scale and the optimal −½ log n correction. The finite bounds also yield the exact decay exponent of success above capacity and a matching error exponent on a specified interval below capacity. Which inputs are optimal under Gaussian noise? For n identical nonidentity gauge-covariant Gaussian channels, with thermal photon means transformed as r ↦ ar+b, a > 0 and b ≥ max{0,a−1}, the paper determines the exact fixed-photon Holevo optimum and every ensemble attaining it. Each optimal letter places all K photons in one collective mode: ∣K,u⟩=(∑j=1nujaj†)KK!∣0⟩,∑j∣uj∣2=1.|K,u\rangle=\frac{\left(\sum_{j=1}^{n}u_j a_j^\dagger\right)^K}{\sqrt{K!}}|0\rangle,\qquad \sum_j|u_j|^2=1.∣K,u⟩=K!​(∑j=1n​uj​aj†​)K​∣0⟩,∑j​∣uj​∣2=1. An ensemble is optimal precisely when almost all its letters have this form and its average is uniform on the K-photon sector. A finite weighted optimal ensemble exists. These collective modes may themselves extend across, and be entangled among, physical optical modes. Thus the characterization identifies the structure to optimize without imposing a Gaussian-input restriction. The central proof step combines different loss histories that end in the same output photon sector. A common ordering of the comparison eigenstates allows the separate majorization bounds to be combined. For pure loss, a quantitative rigidity estimate further converts a small Holevo deficit into closeness to collective-mode number states. Resource cost and communication across blocks At fixed positive photon density and fixed nonidentity Gaussian noise, requiring an exact photon supply incurs a Holevo penalty of ½ log n plus an explicitly determined constant, relative to the usual mean-energy value. The paper separates this cost into photon-count uncertainty and the mismatch from a thermal output distribution. For separately constrained blocks of quantum-limited loss, quantum-limited amplification or entanglement-breaking Gaussian noise, the one-block Holevo values add exactly. Every optimal letter is a product of blockwise collective-mode number states, and the repeated-block unassisted classical capacity equals the one-block Holevo value. The low-rate reliability interval outside the matching range and repeated-block additivity for intermediate Gaussian noise remain open.
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 constraint and for arbitrary encoded states, including states correlated across all input modes, and arbitrary joint decoders. The proof combines quantum Chebyshev and hockey-stick testing inequalities with a uniform relative-entropy-variance bound for the balanced pure-loss channel, corresponding to transmissivity η=1/2η=1/2η=1/2. The variance bound follows by expressing the balanced beam splitter in bright and dark modes: the dark modes are exactly in vacuum, and any state orthogonal to that vacuum contains at least one dark photon. For general transmissivity, dilating the degrading attenuator reduces the problem to this balanced-channel setting and bounds the decoder test by precisely the factor that produces the known quantum-capacity threshold. The resulting argument establishes the strong converse at the unconstrained quantum capacity for every pure-loss bosonic channel.
We determine the two-way quantum, entanglement-distribution, private, and secret-key capacities of the pure-loss bosonic channel under an unconditional mean transmitted-photon-number constraint. For transmissivity ηηη and mean photon number NNN, all four capacities coincide and are given by g(N)−g((1−η)N)g(N)-g((1-η)N)g(N)−g((1−η)N), where ggg is the entropy of a thermal mode. This resolves the longstanding energy-constrained capacity problem by establishing the optimality of the reverse-coherent-information rate introduced in 2009. Our central tool is sector teleportation simulation, which we develop specifically to transfer the input-energy constraint to the shared entanglement resource, thereby preserving the constraint throughout converse arguments for general adaptive protocols. For every N>0N>0N>0, we further show that the corresponding strong-converse thresholds coincide with the unconstrained value −log⁡2(1−η)-\log_2(1-η)−log2​(1−η). For parallel protocols with a hard total-photon-number cutoff, the same energy-constrained capacity formula instead satisfies an exponential strong converse. As an extension, we determine the energy-constrained two-way capacities of the quantum-limited amplifier, showing that classical assistance does not improve its unassisted quantum and private rates. Together, these results establish a unified finite-energy framework for adaptive bosonic communication and reveal how energy constraints fundamentally reshape both attainable rates and converse bounds.
Photon loss is a dominant noise process in bosonic quantum hardware, including superconducting cavities. Fixed-total-photon-number qubit encodings in two bosonic modes retain the loss-detection advantage of dual-rail qubits while supporting photon loss correction. Optimizing entanglement fidelity in this setting for 4≤n≤254\leq n\leq254≤n≤25 over arbitrary encoders and decoders reveals finite-group structure in every best-found code: 11 correspond to two-dimensional irreducible representations and 11 to reducible ones. Motivated by this emergence, we derive the necessary-and-sufficient Knill-Laflamme conditions for arbitrary finite-group-invariant codes, reducing their construction to equations on representation multiplicity spaces. For every finite subgroup of SU(2)SU(2)SU(2) and every tensor rank, we explicitly construct the minimum number of operators required to impose all corresponding loss-correction constraints. These results produce analytic counterparts to most numerical codes and predict constructions missed by the initial search. Exact MacWilliams-Farkas certificates show that our codes achieve the maximum possible loss distance in 21 of the 22 sectors, and we prove that the resulting distance bound is monotone in total photon number. Beyond the scan, we identify a binary-polyhedral sequence with photon number nd=⌈(3d2+1)/4⌉n_d=\lceil(3d^2+1)/4\rceilnd​=⌈(3d2+1)/4⌉ and construct each corresponding code through distance d=10d=10d=10. To our knowledge, the constructed (n,d)=(28,6),(49,8),(76,10)(n,d)=(28,6),(49,8),(76,10)(n,d)=(28,6),(49,8),(76,10) codes give the smallest reported nnn for their respective distances; all members through d=9d=9d=9 attain the fixed-nnn LP distance bound. Together, these constructions, certificates, and a symmetry-reduced constraint count provide evidence for an infinite code family conjectured to attain every distance at the minimum photon number.