Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.04694

Stabilizer codes over general phase spaces

Sayan Chakraborty, Victor V. Albert

quant-phcs.ITmath-phmath.OASubmitted Oct 3, 2026• Announced Oct 6, 2026• 0 citations
arXivHTMLPDF

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.

No sign of AI-generated text

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

Related papers

Hybrid Oscillator-Qudit Quantum Processors: Stabilizer States, Stabilizer Codes, Symplectic Operations, and Noncommutative Geometry

S. Chakraborty, Victor V. Albert

We construct stabilizer states and error-correcting codes on hybrid discrete- and continuous-variable systems, generalizing the Gottesman-Kitaev-Preskill (GKP) lattice formalism. Our framework embeds qudit phase space into a hybrid phase space parameterized by continuous variables, with unit cells that grow with qudit dimension—enabling simultaneous measurement of an arbitrarily large range of noncommuting displacements. Simple hybrid states arise from applying a conditional displacement to a GKP state and a Pauli eigenstate, or by encoding qudits of a stabilizer state into a GKP code; their oscillator-qudit entanglement is non-Gaussian, distinguishing them as a resource beyond tensor products of stabilizer states. Simple hybrid codes are subsystem GKP codes whose gauge factor is entangled with a qudit. Numerical experiments suggest that they can outperform GKP codes against physical noise, with decoders tunable to either qudit or oscillator errors. We also relate stabilizer codes to noncommutative tori, showing that a general construction yields multimode multiqudit GKP extensions. We compute the codes’ logical dimension and operators via Morita equivalence.

arXiv:2508.04819•PRX Quantum•Feb 26, 2026•3 citations

Dynamical GKP codes

Jonathan Pelletier, Baptiste Royer

Dynamical codes protect quantum information with sequences of measurements, generalizing the stabilizer formalism of static codes. However, the dynamical formalism has been developed exclusively for qubit systems. While Gottesman-Kitaev-Preskill (GKP) codes are promising candidates for quantum computing that encode qubits in the continuous phase space of oscillators, no dynamical formalism has been developed for them. In this work, we bridge this gap and introduce dynamical GKP codes, combining continuous-variable lattice encodings with time-dependent translation measurement dynamics. To obtain the update rules and the distance of a given measurement sequence, we first generalize GKP codes to subsystem GKP codes using scaled symplectic lattices. Building on this structure, we adapt the ancestry, detector, and benign-error machinery originally developed for dynamical qubit codes. From this construction, we obtain a general and efficient method to compute the syndrome and distance of a dynamical GKP code from a persistent stabilizer lattice and a bounded inference window. We illustrate the framework with the example of the two-mode square-hexagonal Floquet GKP code. This code has reduced measurement weight compared to both the square and hexagonal GKP codes, while combining their set of logical gates, resulting in easier implementation of the full single-qubit Clifford group. Finally, we show that measurements with irrational symplectic overlap, which have no analog in discrete qubit codes, reduce to destructive homodyne detection in the single-mode case. These results extend an important qubit-code tool to continuous-variable systems and identify a new bridge between discrete stabilizer measurements and continuous homodyne detection.

arXiv:2611.14081•Nov 10, 2026•0 citations

From Syndromes to Computation: A General Framework for Logical Operations in Quantum Error-Correcting Codes

Hunter Nelson, Arshag Danageozian, ChunJun Cao +2 more

Fault-tolerant quantum computation requires error-correcting codes that not only protect quantum information but also support useful logical operations with practical physical realizations. Here we develop a general framework in which the stabilizer syndromes of commuting Pauli rotations directly organize logical-gate design. We derive an exact codespace-preservation condition valid at arbitrary rotation angles, providing a common stabilizer-level description for CSS and non-CSS codes and for both Clifford and non-Clifford operations. A particularly useful equal-syndrome specialization reduces Clifford gate design to stabilizer factorization, yields a general generator weight bound of $\lceil d/2\rceil$ for distance-$d$ codes, and systematically extends to logical rotations higher in the Clifford hierarchy. Applied to bivariate-bicycle (BB) and non-CSS Mirror qLDPC codes, the framework gives explicit low-weight Clifford and controlled-phase gates. Our implementations yield new low-weight gates, including an addressed $T$ gate on the $[[16,4,4]]$ BB code, $T$-type rotations on the $[[64,8,8]]$ BB code, and CCZ-, CS-, and $T$-type operations on the $[[36,6,6]]$ Mirror code. We also develop analytic constructions using Clifford algebra bases, which turn the syndrome constraints into explicit algebraic relations and provide a systematic route to logical addressability. We use this approach to analytically construct addressed CNOT, SWAP, controlled, and CCZ-type gates on recursive hypercube codes. An independent construction on middle quantum Reed--Muller codes yields C${}^r$Z gates that saturate the equal-syndrome weight bound. These results establish stabilizer syndromes as a constructive link between the stabilizer structure of a quantum code, the logical computations it can directly support, and the fault-tolerance properties of their physical realizations.

quant-pharXiv:2610.17612•Oct 14, 2026•0 citations

On the SU(1,1)-based stabilizer formalism

Valentine Nyirahafashimana, Pak Shen Choong, Nurisya Mohd Shah

Abstract This work is motivated by the geometry and symmetry of continuous-variable (CV) and open quantum systems. We describe a stabilizer formalism based on the noncompact group SU(1,1). In contrast to the Pauli stabilizer codes, which are finite and discrete, and the GKP code, which uses displacement stabilizers on a flat phase-space lattice, the SU(1,1) approach is naturally connected to hyperbolic geometry. Errors can be organized into elliptic, parabolic, and hyperbolic types according to the subgroup structure of SU(1,1). This provides new classes of stabilizer operations that go beyond the Pauli–Clifford setting and at the same time, can capture the encoding structure of the GKP code. The construction is preliminary, but it suggests a more general framework for building fault-tolerant codes tailored to continuous-variable systems. It is natural to conjecture that SU(1,1)-based stabilizers admit a coset-like decomposition, with elliptic, parabolic, and hyperbolic subgroups playing the role of error classes, in analogy with the Pauli case. This perspective offers a pathway toward defining logical operators and error classification in hyperbolic phase space.

Journal of Physics Conference Series•Dec 1, 2025•0 citations

Bosonic codes from compact phase spaces

David Roberts, Aaron Slipper, Alireza Parhizkar +2 more

We present the algebraic structure of bosonic quantum error-correcting codes on genus-two Riemann surfaces. We explicitly construct the code words as automorphic forms and analytically generate the full tower of code spaces at all weights. We prove a fundamental no-go theorem: for any genus greater than one, the stabilizer group is non-amenable, forcing a strictly positive spectral gap in the stabilizer Hamiltonian. Consequently, no normalizable quantum state can satisfy all stabilizer conditions. This sharply contrasts with standard Gottesman-Kitaev-Preskill (GKP) codes, where the amenability of the stabilizer group $\mathbb{Z}^2$ permits approximate code words with arbitrary precision.

quant-pharXiv:2608.31156•Sep 1, 2026•0 citations

Quantum Lego and XP Stabilizer Codes

Ruohan Shen, Yixu Wang, ChunJun Cao

We apply the recent graphical framework of "Quantum Lego" to XP stabilizer codes where the stabilizer group is generally non-Abelian. We show that the idea of operator matching continues to hold for such codes and is sufficient for generating all their XP symmetries provided the resulting code is XP. We provide an efficient classical algorithm for tracking these symmetries under tensor contraction or conjoining. This constitutes a partial extension of the algorithm implied by the Gottesman-Knill theorem beyond Pauli stabilizer states and Clifford operations. Because conjoining transformations generate quantum operations that are universal, the XP symmetries obtained from these algorithms do not uniquely identify the resulting tensors in general. Using this extended framework, we provide examples of novel XP stabilizer codes with a higher distance than existing non-trivial XP regular codes and a [[8,1,2]] Pauli stabilizer code with a fault-tolerant T gate. For XP regular codes, we also construct a tensor-network-based maximum likelihood decoder for any independently and identically distributed single qubit error channel using weight enumerators.

arXiv:2310.19538•Quantum•Oct 6, 2025•13 citations
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.
The paper asks how stabilizer-code theory extends to systems combining oscillators, planar rotors, and finite-dimensional qudits. It treats configuration groups M=Rp×Zq×∏jZcjM=\mathbb R^p\times\mathbb Z^q\times\prod_j\mathbb Z_{c_j}M=Rp×Zq×∏j​Zcj​​ and stabilizers labeled by arbitrary isotropic lattices D⊂M×M^D\subset M\times\widehat MD⊂M×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∣μK=|G/D|_\muK=∣G/D∣μ​. A full integer lift, including rotor and qudit periods, gives K=∣Pf⁡(TTJT)∣K=|\operatorname{Pf}(T^{\mathsf T}JT)|K=∣Pf(TTJT)∣ and logical generators from T(TTJT)−1T(T^{\mathsf T}JT)^{-1}T(TTJT)−1; the logical displacement group D⊥/DD^\perp/DD⊥/D has order K2K^2K2. 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=4K=4K=4 code establishes the minimum dimension for intrinsic coupling. Rotor–qudit systems admit intrinsic coupling even for stabilizer states with K=1K=1K=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.
We construct stabilizer states and error-correcting codes on hybrid discrete- and continuous-variable systems, generalizing the Gottesman-Kitaev-Preskill (GKP) lattice formalism. Our framework embeds qudit phase space into a hybrid phase space parameterized by continuous variables, with unit cells that grow with qudit dimension—enabling simultaneous measurement of an arbitrarily large range of noncommuting displacements. Simple hybrid states arise from applying a conditional displacement to a GKP state and a Pauli eigenstate, or by encoding qudits of a stabilizer state into a GKP code; their oscillator-qudit entanglement is non-Gaussian, distinguishing them as a resource beyond tensor products of stabilizer states. Simple hybrid codes are subsystem GKP codes whose gauge factor is entangled with a qudit. Numerical experiments suggest that they can outperform GKP codes against physical noise, with decoders tunable to either qudit or oscillator errors. We also relate stabilizer codes to noncommutative tori, showing that a general construction yields multimode multiqudit GKP extensions. We compute the codes’ logical dimension and operators via Morita equivalence.
Dynamical codes protect quantum information with sequences of measurements, generalizing the stabilizer formalism of static codes. However, the dynamical formalism has been developed exclusively for qubit systems. While Gottesman-Kitaev-Preskill (GKP) codes are promising candidates for quantum computing that encode qubits in the continuous phase space of oscillators, no dynamical formalism has been developed for them. In this work, we bridge this gap and introduce dynamical GKP codes, combining continuous-variable lattice encodings with time-dependent translation measurement dynamics. To obtain the update rules and the distance of a given measurement sequence, we first generalize GKP codes to subsystem GKP codes using scaled symplectic lattices. Building on this structure, we adapt the ancestry, detector, and benign-error machinery originally developed for dynamical qubit codes. From this construction, we obtain a general and efficient method to compute the syndrome and distance of a dynamical GKP code from a persistent stabilizer lattice and a bounded inference window. We illustrate the framework with the example of the two-mode square-hexagonal Floquet GKP code. This code has reduced measurement weight compared to both the square and hexagonal GKP codes, while combining their set of logical gates, resulting in easier implementation of the full single-qubit Clifford group. Finally, we show that measurements with irrational symplectic overlap, which have no analog in discrete qubit codes, reduce to destructive homodyne detection in the single-mode case. These results extend an important qubit-code tool to continuous-variable systems and identify a new bridge between discrete stabilizer measurements and continuous homodyne detection.
Fault-tolerant quantum computation requires error-correcting codes that not only protect quantum information but also support useful logical operations with practical physical realizations. Here we develop a general framework in which the stabilizer syndromes of commuting Pauli rotations directly organize logical-gate design. We derive an exact codespace-preservation condition valid at arbitrary rotation angles, providing a common stabilizer-level description for CSS and non-CSS codes and for both Clifford and non-Clifford operations. A particularly useful equal-syndrome specialization reduces Clifford gate design to stabilizer factorization, yields a general generator weight bound of ⌈d/2⌉\lceil d/2\rceil⌈d/2⌉ for distance-ddd codes, and systematically extends to logical rotations higher in the Clifford hierarchy. Applied to bivariate-bicycle (BB) and non-CSS Mirror qLDPC codes, the framework gives explicit low-weight Clifford and controlled-phase gates. Our implementations yield new low-weight gates, including an addressed TTT gate on the [[16,4,4]][[16,4,4]][[16,4,4]] BB code, TTT-type rotations on the [[64,8,8]][[64,8,8]][[64,8,8]] BB code, and CCZ-, CS-, and TTT-type operations on the [[36,6,6]][[36,6,6]][[36,6,6]] Mirror code. We also develop analytic constructions using Clifford algebra bases, which turn the syndrome constraints into explicit algebraic relations and provide a systematic route to logical addressability. We use this approach to analytically construct addressed CNOT, SWAP, controlled, and CCZ-type gates on recursive hypercube codes. An independent construction on middle quantum Reed--Muller codes yields Cr{}^rrZ gates that saturate the equal-syndrome weight bound. These results establish stabilizer syndromes as a constructive link between the stabilizer structure of a quantum code, the logical computations it can directly support, and the fault-tolerance properties of their physical realizations.
Abstract This work is motivated by the geometry and symmetry of continuous-variable (CV) and open quantum systems. We describe a stabilizer formalism based on the noncompact group SU(1,1). In contrast to the Pauli stabilizer codes, which are finite and discrete, and the GKP code, which uses displacement stabilizers on a flat phase-space lattice, the SU(1,1) approach is naturally connected to hyperbolic geometry. Errors can be organized into elliptic, parabolic, and hyperbolic types according to the subgroup structure of SU(1,1). This provides new classes of stabilizer operations that go beyond the Pauli–Clifford setting and at the same time, can capture the encoding structure of the GKP code. The construction is preliminary, but it suggests a more general framework for building fault-tolerant codes tailored to continuous-variable systems. It is natural to conjecture that SU(1,1)-based stabilizers admit a coset-like decomposition, with elliptic, parabolic, and hyperbolic subgroups playing the role of error classes, in analogy with the Pauli case. This perspective offers a pathway toward defining logical operators and error classification in hyperbolic phase space.
We present the algebraic structure of bosonic quantum error-correcting codes on genus-two Riemann surfaces. We explicitly construct the code words as automorphic forms and analytically generate the full tower of code spaces at all weights. We prove a fundamental no-go theorem: for any genus greater than one, the stabilizer group is non-amenable, forcing a strictly positive spectral gap in the stabilizer Hamiltonian. Consequently, no normalizable quantum state can satisfy all stabilizer conditions. This sharply contrasts with standard Gottesman-Kitaev-Preskill (GKP) codes, where the amenability of the stabilizer group Z2\mathbb{Z}^2Z2 permits approximate code words with arbitrary precision.
We apply the recent graphical framework of "Quantum Lego" to XP stabilizer codes where the stabilizer group is generally non-Abelian. We show that the idea of operator matching continues to hold for such codes and is sufficient for generating all their XP symmetries provided the resulting code is XP. We provide an efficient classical algorithm for tracking these symmetries under tensor contraction or conjoining. This constitutes a partial extension of the algorithm implied by the Gottesman-Knill theorem beyond Pauli stabilizer states and Clifford operations. Because conjoining transformations generate quantum operations that are universal, the XP symmetries obtained from these algorithms do not uniquely identify the resulting tensors in general. Using this extended framework, we provide examples of novel XP stabilizer codes with a higher distance than existing non-trivial XP regular codes and a [[8,1,2]] Pauli stabilizer code with a fault-tolerant T gate. For XP regular codes, we also construct a tensor-network-based maximum likelihood decoder for any independently and identically distributed single qubit error channel using weight enumerators.