Description
Qudit-into-oscillator code whose protection against AD noise (i.e., photon loss) stems from the use of disjoint sets of Fock states for the construction of each code basis state. The simplest example is the dual-rail code, which has codewords consisting of single Fock states \(|10\rangle\) and \(|01\rangle\). This code can detect a single loss error since a loss operator in either mode maps one of the codewords to a different Fock state \(|00\rangle\). More involved codewords consist of several well-separated Fock states such that multiple loss events can be detected and corrected.Protection
Code distance \(d\) is the minimum distance (assuming some metric) between any two labels of Fock states corresponding to different code basis states. For a single mode, \(d\) is the minimum absolute value of the difference between any two Fock-state labels; such codes can detect up to \(d-1\) loss events. Multimode distances can be defined analogously; see, e.g., Chuang-Leung-Yamamoto codes. There are tradeoffs in how well a Fock-state code protects against loss/gain errors and dephasing noise [1].Rate
For every \(K,t \geq 2\), there are explicitly constructible \(K\)-dimensional Fock-state codes with \(q=N=(K-1)t(t+1)\) modes, total excitation \(N\), and bosonic distance \(t+1\); there also exist families with logical dimension \(K = o(2^N)\) and distance of order \(o(N/\log N)\) [2]. Asymptotically good Fock-state codes exist: for sufficiently small \(\delta>0\), there are families on \(q=\alpha N\) modes with total excitation \(N\), distance at least \(\lfloor\delta N\rfloor\), and positive rate \(\log_2 K/\log_2\binom{N+q-1}{q-1}\) [3; Thm. 12]. Each mode holds at most \((1+\epsilon)\log_{1+\alpha}N\) excitations for any fixed \(\epsilon>0\) [3; Thm. 12]. Uniformly superposing equal blocks of a random simplex integer-based code yields, with high probability, positive-rate approximate codes that correct a number of losses linear in \(N\) with vanishing recovery error [3; Thm. 10]. Their per-mode occupancy is of order \(O(\log N)\) for classical codewords drawn uniformly from the simplex, up to a vanishing probability under a photon-number measurement [3; Thm. 10]. Multinomially distributed classical codewords lower this bound to \(O(\log N/\log\log N)\) [3; Thm. 10].Cousins
- Binary code— Fock-state code distance is a natural extension of Hamming distance between binary strings.
- Simplex integer-based code— Constant-excitation Fock-state codes can be obtained from simplex integer-based codes by partitioning the classical code into blocks and superposing the Fock states of each block [2]. Classical \(\ell_1\) distance \(t+1\) guarantees the Knill-Laflamme orthogonality conditions against up to \(t\) losses, and a Tverberg partition with suitable coefficients yields quantum distance \(t+1\) [2][3; Prop. 7]. With high probability, random simplex integer-based codes partitioned into equal blocks with uniform superpositions yield asymptotically good approximate Fock-state codes [3; Thm. 10].
- Fock-state OOK c-q modulation format— Fock-state OOK transmits classical information using Fock states, while Fock-state bosonic codes store quantum information in subspaces built from Fock states.
- Tiger code— Tiger codes encoding logical qudits are Fock-state codes.
- Permutation-invariant (PI) code— Modular-qudit PI codes can be converted to constant-excitation Fock-state codes via the simplex mapping [2; Prop. V.2]. Any transversal gates are mapped to Gaussian gates on the Fock-state codes [2].
- Twisted \(1\)-group code— PI twisted \(1\)-group codes can be converted to constant-excitation Fock-state codes via the simplex mapping [2; Prop. V.2]. Any transversal gates are mapped to Gaussian gates on the Fock-state codes [2].
Primary Hierarchy
References
- [1]
Y. Ouyang and E. T. Campbell, “Trade-Offs on Number and Phase Shift Resilience in Bosonic Quantum Codes”, IEEE Transactions on Information Theory 67, 6644 (2021) arXiv:2008.12576 DOI
- [2]
A. Aydin, V. V. Albert, and A. Barg, “Quantum Error Correction beyond <mml:math xmlns:mml=”http://www.w3.org/1998/Math/MathML” display=”inline”> <mml:mi>S</mml:mi> <mml:mi>U</mml:mi> <mml:mo stretchy=”false”>(</mml:mo> <mml:mn>2</mml:mn> <mml:mo stretchy=”false”>)</mml:mo> </mml:math> : Spin, Bosonic, and Permutation-Invariant Codes from Convex Geometry”, PRX Quantum 7, (2026) arXiv:2509.20545 DOI
- [3]
D. Elimelech, A. Aydin, and A. Barg, “Asymptotically good bosonic Fock state codes”, Quantum 10, 2240 (2026) arXiv:2603.15190 DOI
Page edit log
- Victor V. Albert (2026-10-26) — most recent
- Victor V. Albert (2026-06-08)
- Victor V. Albert (2021-12-30)
Cite as:
“Fock-state bosonic code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/fock_state, arXiv:2606.11484