arXiv:2610.04694
Stabilizer codes over general phase spaces
Sayan Chakraborty, Victor V. Albert
Abstract
We develop a theory of stabilizer codes whose stabilizer groups consist of commuting qudit Paulis, oscillator displacements, and/or planar-rotor displacements. We consider codes whose stabilizer groups form generalized lattices in quantum phase space, a condition that guarantees a finite logical dimension. We construct oscillator-rotor, rotor-qudit, and oscillator-rotor-qubit codes that cannot be decomposed into separate subsystems by generalized Clifford transformations. We also introduce an oscillator-qubit code arising from a partially lifted Golay code, where Construction A is applied to half of the Golay code coordinates. We derive analytical forms of logical operators from the symplectic dual lattice, determine Clifford-Gaussian gates from lattice symmetries, show that the code dimension equals the covolume of the stabilizer lattice, and organize the syndrome subspaces into a vector bundle. Our technique builds on earlier non-commutative geometric results by Rieffel, but it can often be interpreted simply as concatenating a given stabilizer code with a Gottesman-Kitaev-Preskill (GKP) code, applying conventional lattice-theoretic results, and unconcatenating. We formulate distances, optimal decoding, and quantum weight enumerators, recovering the Pauli, qudit, and GKP versions together with known MacWilliams identities. We construct finite-energy codewords whose encoding is an isometry up to an error exponentially small in the inverse damping parameter.
AI Summary
The paper asks how stabilizer-code theory extends to systems combining oscillators, planar rotors, and finite-dimensional qudits. It treats configuration groups $M=\mathbb R^p\times\mathbb Z^q\times\prod_j\mathbb Z_{c_j}$ and stabilizers labeled by arbitrary isotropic lattices $D\subset M\times\widehat M$, including lattices with torsion. Using Rieffel’s Morita-equivalence modules, it organizes syndrome spaces into a Hermitian vector bundle and derives a Bloch–Floquet decomposition of the physical Hilbert space. The logical dimension is the stabilizer covolume, $K=|G/D|_\mu$. A full integer lift, including rotor and qudit periods, gives $K=|\operatorname{Pf}(T^{\mathsf T}JT)|$ and logical generators from $T(T^{\mathsf T}JT)^{-1}$; the logical displacement group $D^\perp/D$ has order $K^2$. Lattice symmetries yield logical Clifford operations after displacement corrections. New examples include a twelve-oscillator–twelve-qubit Golay construction encoding one qubit, intrinsically non-CSS rotor codes, and hybrid codes that cannot be separated by generalized Clifford transformations. For one oscillator and one rotor, every square-free-dimensional code decomposes; an explicit $K=4$ code establishes the minimum dimension for intrinsic coupling. Rotor–qudit systems admit intrinsic coupling even for stabilizer states with $K=1$. The framework also unifies displacement distances, maximum-likelihood decoding, and Fourier/MacWilliams enumerator identities. Gaussian damping produces finite-energy encodings with exponentially small isometry error in inverse damping. The scope excludes non-cocompact stabilizer subgroups and infinite-dimensional logical spaces. Ideal codewords can be non-normalizable, and equivalence to concatenated GKP codes does not preserve physical error sets or Clifford groups.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 52 pages + appendices, 1 figure, 2 tables