Particle-loss error correction using
2l-step states generated via particle-number-resolving measurement schemes
Bosonic codes, leveraging infinite-dimensional Hilbert spaces for redundancy, offer great potential for encoding quantum information. However, a practical continuous-variable bosonic code that can simultaneously correct both photon loss and dephasing errors, while achieving a high level of compliance with the Knill-Laflamme conditions within an experimentally friendly structure, remains elusive. Here, we propose a code based on the superposition of squeezed Fock states with an error-correcting capability that scales as ∝exp(-7r), where r is the squeezing level. The codewords remain orthogonal at all squeezing levels. In particular, this code achieves high-precision error correction for both single-photon loss and dephasing, even at moderate squeezing levels. Building on this code, we develop quantum error correction schemes that exceed the breakeven point, supported by analytical derivations of all necessary quantum gates. Our code offers a competitive alternative to previous encodings for quantum computation using continuous bosonic qubits.
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≤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) 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⌉ 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.
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
δ≈0.158.