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.

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•1 citation

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

Qubit-oscillator concatenated codes: decoding formalism & code comparison

Yijia Xu, Yixu Wang, En-Jui Kuo +1 more

Concatenating bosonic error-correcting codes with qubit codes can substantially boost the error-correcting power of the original qubit codes. It is not clear how to concatenate optimally, given there are several bosonic codes and concatenation schemes to choose from, including the recently discovered GKP-stabilizer codes [Phys. Rev. Lett. 125, 080503 (2020)}] that allow protection of a logical bosonic mode from fluctuations of the mode's conjugate variables. We develop efficient maximum-likelihood decoders for and analyze the performance of three different concatenations of codes taken from the following set: qubit stabilizer codes, analog/Gaussian stabilizer codes, GKP codes, and GKP-stabilizer codes. We benchmark decoder performance against additive Gaussian white noise, corroborating our numerics with analytical calculations. We observe that the concatenation involving GKP-stabilizer codes outperforms the more conventional concatenation of a qubit stabilizer code with a GKP code in some cases. We also propose a GKP-stabilizer code that suppresses fluctuations in both conjugate variables without extra quadrature squeezing, and formulate qudit versions of GKP-stabilizer codes.

arXiv:2209.04573•Sep 10, 2022•0 citations

Complex abelian varieties and quantum error correction: a mathematical framework for GKP codes

Maxence Mayrand, Baptiste Royer

We study a class of quantum error-correcting codes through the geometry of complex abelian varieties. These codes, introduced by Gottesman--Kitaev--Preskill, are built from symplectically integral lattices and therefore naturally define polarized complex abelian varieties. We give a precise mathematical formulation of this relationship and extend it to a dictionary between the main structures of GKP code theory and classical objects in the theory of abelian varieties. For instance, under this dictionary, the finite-dimensional code space becomes the space of theta functions $H^0(X, L)$, logical Pauli gates arise from the theta group, passive logical Clifford gates correspond to automorphisms of the polarized abelian variety, and concatenation with stabilizer codes corresponds to isogeny. We also prove several key results that give precise mathematical formulations of statements about these codes that often appear in heuristic form in the physics literature. In particular, we prove that the encoding is asymptotically isometric, that every logical Clifford gate is realized by a Gaussian unitary, and that, for noise of small variance, the failure probability is governed to first order by the shortest nontrivial displacement in the kernel of the polarization isogeny, a systolic invariant of the underlying polarization. This leads naturally to optimization problems on the moduli space of polarized abelian varieties.

math.AGCross-listedarXiv:2605.28784•May 28, 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

Phase-Space Representations of Quantum Error-Correcting Codes

Enrico Bozzetto, Jonte R. Hance

We connect the structure theorem for quasiprobability representations to quantum error correction. For a code space invariant under a subgroup of an extended Weyl-Heisenberg group, the Brif-Mann construction gives a semi-functorial representation whenever its kernel satisfies the Stratonovich-Weyl axioms, and composes on channels covering full error-correction cycles. With phase-space parity available, a kernel other than the ordinary Wigner one exists iff the code space is invariant under a lattice of displacements: among compact-phase-space bosonic codes, this is only the ideal Gottesman-Kitaev-Preskill family; in finite dimension, this is every qudit stabiliser code, whose negative volume for odd prime dimension is the syndrome-averaged logical magic. For rotation-symmetric, one-photon, non-Pauli qudit and spin codes only the ordinary kernel remains, its negativity reflecting the physical carrier, not logical content; a sector-graded representation built from recovery isometries restores a resource reading. We add a channel atlas, a closed-form magic lifetime under displacement noise, a Kirkwood-Dirac layer, and finite-energy corrections.

quant-pharXiv:2607.02164•Physical Review Research•Jul 3, 2026•0 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.
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.
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.
Concatenating bosonic error-correcting codes with qubit codes can substantially boost the error-correcting power of the original qubit codes. It is not clear how to concatenate optimally, given there are several bosonic codes and concatenation schemes to choose from, including the recently discovered GKP-stabilizer codes [Phys. Rev. Lett. 125, 080503 (2020)}] that allow protection of a logical bosonic mode from fluctuations of the mode's conjugate variables. We develop efficient maximum-likelihood decoders for and analyze the performance of three different concatenations of codes taken from the following set: qubit stabilizer codes, analog/Gaussian stabilizer codes, GKP codes, and GKP-stabilizer codes. We benchmark decoder performance against additive Gaussian white noise, corroborating our numerics with analytical calculations. We observe that the concatenation involving GKP-stabilizer codes outperforms the more conventional concatenation of a qubit stabilizer code with a GKP code in some cases. We also propose a GKP-stabilizer code that suppresses fluctuations in both conjugate variables without extra quadrature squeezing, and formulate qudit versions of GKP-stabilizer codes.
We study a class of quantum error-correcting codes through the geometry of complex abelian varieties. These codes, introduced by Gottesman--Kitaev--Preskill, are built from symplectically integral lattices and therefore naturally define polarized complex abelian varieties. We give a precise mathematical formulation of this relationship and extend it to a dictionary between the main structures of GKP code theory and classical objects in the theory of abelian varieties. For instance, under this dictionary, the finite-dimensional code space becomes the space of theta functions H0(X,L)H^0(X, L)H0(X,L), logical Pauli gates arise from the theta group, passive logical Clifford gates correspond to automorphisms of the polarized abelian variety, and concatenation with stabilizer codes corresponds to isogeny. We also prove several key results that give precise mathematical formulations of statements about these codes that often appear in heuristic form in the physics literature. In particular, we prove that the encoding is asymptotically isometric, that every logical Clifford gate is realized by a Gaussian unitary, and that, for noise of small variance, the failure probability is governed to first order by the shortest nontrivial displacement in the kernel of the polarization isogeny, a systolic invariant of the underlying polarization. This leads naturally to optimization problems on the moduli space of polarized abelian varieties.
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 connect the structure theorem for quasiprobability representations to quantum error correction. For a code space invariant under a subgroup of an extended Weyl-Heisenberg group, the Brif-Mann construction gives a semi-functorial representation whenever its kernel satisfies the Stratonovich-Weyl axioms, and composes on channels covering full error-correction cycles. With phase-space parity available, a kernel other than the ordinary Wigner one exists iff the code space is invariant under a lattice of displacements: among compact-phase-space bosonic codes, this is only the ideal Gottesman-Kitaev-Preskill family; in finite dimension, this is every qudit stabiliser code, whose negative volume for odd prime dimension is the syndrome-averaged logical magic. For rotation-symmetric, one-photon, non-Pauli qudit and spin codes only the ordinary kernel remains, its negativity reflecting the physical carrier, not logical content; a sector-graded representation built from recovery isometries restores a resource reading. We add a channel atlas, a closed-form magic lifetime under displacement noise, a Kirkwood-Dirac layer, and finite-energy corrections.