arXiv:2610.34411
Bosonic Loss Codes with Bounded Occupation
Avraham Kreindel, Aryeh Lev Zabokritskiy
Abstract
We study Fock-state codes on $q$ bosonic modes, with total excitation $N$ and at most $B$ excitations per mode, that exactly correct every pattern of at most $δN$ photon losses, for $q$ proportional to $N$. For every fixed cap $B$ and every ratio $q/N>1/B$, we prove explicit achievable rates, positive for all sufficiently small $δ>0$, in logical qubits per excitation. At $B=2$ and $q=N$, the rate is positive for every $δ<0.1355$ and is about $0.281$ at $δ=0.1$, compared with the previously established exact-code qutrit rate of about $0.275$. We also give an explicit upper bound on the dimension of every such exact code, including degenerate codes. For the pure-loss channel truncated to at most $δN$ losses and renormalized, we obtain approximate codes with exponentially small worst-case error. When the loss probability is positive and at most $1/(B+1)$, they improve our positive exact-code rate bounds; at $B=2$, $q=N$, and loss probability $0.1$, they remain positive up to $δ\approx0.158$.
AI Summary
The paper studies constant-excitation bosonic codes on $q=\lfloor\alpha N\rfloor$ modes, with at most $B$ photons per mode, that exactly correct every pattern of up to $\lfloor\delta N\rfloor$ losses. Positive rate under a fixed occupation cap was already possible; the question here is quantitative achievable rates and converse bounds. The exact-code construction combines constant-composition Gilbert–Varshamov bounds for occupation vectors in deletion distance with Aydin–Albert–Barg/Tverberg lifting. Removing inactive loss moments replaces the lifting denominator by $m_B(q,t)=[z^t](1+z+\cdots+z^B)^q$. A finite-dimensional entropy optimization gives rates positive for sufficiently small $\delta$ whenever $\alpha B>1$. For $B=2$ and $q=N$, a closed-form optimized histogram yields about $0.281$ logical qubits per excitation at $\delta=0.1$, versus the prior qutrit bound of $0.275$, and remains positive for $\delta<0.1355$. Additional results include exact capped-distance enumerators, majorization-based extremal ball volumes, bounded-occupation sampling, and a derivative-rank converse valid for degenerate quantum codes. At the cap-two benchmark, its upper exponent is about $1.188$, leaving a substantial gap. Average-ball exponents also survive every occupation cap tending to infinity. For one renormalized pure-loss channel truncated to the allowed losses, random equal-weight partition codes achieve exponentially vanishing worst-case error. At loss probability $0.1$, cap-two rates remain positive to $\delta\approx0.158$; transfer to the full channel requires $\delta>\gamma$. These guarantees are channel-specific. Efficient optimized supports, exact encoders, Tverberg partitions, and recoveries are not supplied.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 51 pages, 4 tables. Supplementary computational certificates: https://doi.org/10.5281/zenodo.22693414