arXiv:2609.26660
Error Correction Properties of Covariant Bosonic Encodings
Frederic St-Amand, Jean-Philippe Burelle, Baptiste Royer
Abstract
Bosonic codes offer a promising approach towards hardware-efficient fault tolerance, with many leading examples such as the cat-code and the GKP code organized by an underlying symmetry. We build on a representation-theoretic framework of quantum error correction to formalize the construction and analysis of multimode symmetric bosonic codes, focusing on finite groups. Here, a physical, logical representation and an initial seed state together define the codewords via a covariant encoding. A central observation is that QEC matrices can be viewed as morphisms of group representations, so that Schur's lemma forces entire irreducible representations blocks to vanish. We recover several known single- and two-mode bosonic codes and build and analyze the error protection capabilities of three codes based on finite subgroups of SU(2). We analyze the impact of reducibility of the logical representation and optimize the seed state using the near-optimal fidelity.
AI Summary
The paper asks how finite-group covariance constrains error correction in multimode bosonic encodings, and how the logical representation and seed state affect protection against photon loss. It develops a representation-theoretic analysis of codes obtained by projecting coherent-state orbits onto a chosen logical representation, recovering several known cat and cyclic codes and constructing two-mode examples from $Q_8$ and the binary octahedral group $2O$. The central result is that compression of error products to the codespace is an intertwiner. Order-$(L,K)$ loss-product sectors transform as $\mathrm{Sym}^L(\rho_f)\otimes\mathrm{Sym}^K(\rho_f^*)$; Schur’s lemma therefore forces sectors with no matching logical-operator irreducible representation to vanish. If the only shared representation is trivial and the logical representation is irreducible, the corresponding Knill–Laflamme blocks are scalar. Irreducibility also guarantees exact correctability of the no-jump Kraus operator, whereas reducible representations permit logical dephasing. Character decompositions establish these selection rules, supplemented by explicit QEC matrices. Numerical optimization of coherent-state seeds uses an existing near-optimal recovery-fidelity metric. At photon-loss probability $\gamma=0.095$, optimized infidelities are approximately $0.023$ for the illustrated $Q_8$ code and $0.0009$ and $0.0012$ for two $2O$ encodings. Fidelity-optimal seeds do not generally maximize minimum orbit distance. The examples assume equal loss probabilities across modes and restrict seed optimization to coherent states. Symmetry determines allowed logical errors, not all their amplitudes. The paper does not provide a systematic practical recovery protocol.
Error found: The preliminary covariant-encoding prescription incorrectly asserts that scalar normalization makes any nonzero averaged map an isometry, which fails for general reducible logical representations. The coherent-state attenuation factor in η_k is twice the correct exponent, causing the displayed no-jump QEC block to have an incorrect exponential prefactor. The reducible binary-octahedral code's symmetry-allowed (3,3) logical X/Y QEC coefficients scale as γ³, not the claimed γ⁶. The claim of protection against three-photon loss overstates the demonstrated detection properties and does not satisfy the pairwise Knill–Laflamme requirements for correcting all such losses. The proposed O(2) pair-cat construction requires a sign representation absent from its physical Fock representation, so one proposed logical codeword is identically zero.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 19 pages, 6 figures