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:2609.26660

Error Correction Properties of Covariant Bosonic Encodings

Frederic St-Amand, Jean-Philippe Burelle, Baptiste Royer

quant-phSubmitted Sep 22, 2026• Announced Sep 23, 2026• 1 citation
arXivHTMLPDF

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.

Little sign of AI-generated textIncrementalUnclear noveltyMissing comparisonPossible error

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

Related papers

Error Correction Properties of Covariant Bosonic Encodings — E8 Intelligence Research

Andrew Stewart Caldin

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. Source: http://arxiv.org/abs/2 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 10, 2026•0 citations

Quantum Error-Correcting Codes with a Covariant Encoding

Aurélie Denys, Anthony Leverrier

Given some group G of logical gates, for instance the Clifford group, what are the quantum encodings for which these logical gates can be implemented by simple physical operations, described by some physical representation of G? We study this question by constructing a general form of such encoding maps. For instance, we recover that the ⟦5,1,3⟧ and Steane codes admit transversal implementations of the binary tetrahedral and binary octahedral groups, respectively. For bosonic encodings, we show how to obtain the GKP and cat qudit encodings by considering the appropriate groups, and essentially the simplest physical implementations. We further illustrate this approach by introducing a two-mode bosonic code defined from a constellation of 48 coherent states, for which all single-qubit Clifford gates correspond to passive Gaussian unitaries.

arXiv:2306.11621•Physical Review Letters•Dec 11, 2024•16 citations

Intrinsic Quantum Codes

Eric Kubischta, Ian Teixeira

We introduce an intrinsic formulation of quantum error correction based on representation theory, in which error-protection structure is encoded directly in a unitary group representation, rather than being tied to a particular embedding into a larger Hilbert space. In this framework, error models are classified according to the isotypic decomposition of the conjugation action on the operator algebra. Our main result, the \emph{Schur bootstrap}, shows that if an intrinsic code satisfies the Knill--Laflamme conditions on a given symmetry sector, then the same error-protection relations hold for every extrinsic realization obtained from a group-equivariant isometric embedding into a larger Hilbert space. Thus a single intrinsic verification certifies the corresponding symmetry-resolved error-correction conditions across an entire family of physical realizations. We further introduce an intrinsic notion of distance, called depth, defined via adjoint order. For standard multi-qudit systems this coincides with conventional code distance, while for more general representations it refines the usual weight-based notion. We also prove an intrinsic Eastin--Knill theorem: any intrinsic code of depth at least two has a discrete logical symmetry group, with the obstruction to continuous covariant gates arising from the representation-theoretic structure of the adjoint action. We illustrate the framework with several examples, including a minimal $\mathrm{SU}(2)$ construction that unifies permutation-invariant qubit codes and bosonic codes, and higher-dimensional constructions exhibiting transversal Clifford symmetries and realizations beyond qubit systems.

quant-pharXiv:2511.14840•Nov 20, 2025•10 citations

A fault-tolerant encoding for qubit-controlled collective spins

Charlotte Franke, Dorian A. Gangloff

Quantum error correction (QEC) is indispensable for scalable quantum computing, but implementing it with minimal hardware overhead remains a central challenge. Large spin systems with collective degrees of freedom offer a promising route to reducing the control complexity of qubit architectures while retaining a large Hilbert space for fault-tolerant encoding. However, existing proposals for logical gates and QEC in spin ensembles generally rely on inefficient higher-order interactions. Here we introduce spin-N-Cat codes, which encode logical qubits in superpositions of spin-coherent states and generalize bosonic Cat codes to the modular subspaces of permutationally symmetric spin ensembles. The code corrects collective and individual dephasing, excitation, and decay errors. We also present an efficient physical realization in central-spin systems, such as a quantum dot, where encoding, decoding, and a universal, fault-tolerant, and bias-preserving gate set are implemented using only first-order interactions. Numerical simulations demonstrate high logical fidelity under dephasing and excitation-decay noise, independent of noise bias, and that full QEC cycles are feasible with realistic microscopic parameters. For the large collective spins available in quantum dots, this translates into a substantial extension of coherence time. Our results establish spin-N-Cat codes as a scalable, hardware-efficient approach to QEC in spin-based quantum architectures.

quant-pharXiv:2603.15760•Mar 18, 2026•1 citation

Bosonic quantum Fourier codes

Anthony Leverrier

While 2-level systems, aka qubits, are a natural choice to perform a logical quantum computation, the situation is less clear at the physical level. Encoding information in higher-dimensional physical systems can indeed provide a first level of redundancy and error correction that simplifies the overall fault-tolerant architecture. A challenge then is to ensure universal control over the encoded qubits. Here, we explore an approach where information is encoded in an irreducible representation of a finite subgroup of U ( 2 ) through an inverse quantum Fourier transform. We illustrate this idea by applying it to the real Pauli group ⟨ X , Z ⟩ in the bosonic setting. The resulting two-mode Fourier cat code displays good error correction properties and admits an experimentally-friendly universal gate set that we discuss in detail.

arXiv:2505.16618•Quantum•Feb 9, 2026•1 citation

Bosonic Cyclic Codes: Trading Stabilizers for Gaussian Non-Clifford Phase Gates

Owen C. Wetherbee, Yijia Xu, Victor V. Albert +2 more

Bosonic codes offer hardware-efficient approaches to quantum error correction, with the best encodings offering effective protection of idle quantum information against loss and dephasing - particularly rotation-symmetric codes, which include the cat and binomial code families. However, rotation-symmetric codes are only naturally endowed with a single logical Pauli gate, while other logical gates require the use of non-linear operations, obstructing the utility of these codes for realizing quantum algorithms. Here, we balance error protection with controllability by introducing bosonic cyclic codes: a generalization of rotation-symmetric codes that enable the measured tradeoff of error protection properties for fault-tolerant logical phase gates. Through our general construction, we find that sacrificing the detectability of a single photon loss relative to a rotation-symmetric code can yield a number of logical phase gates commensurate with the original rotation symmetry order of the code, all achievable via passive Gaussian rotations. Giving the corresponding generalizations of cat and binomial codes - which we dub cyclic cat and Vandermonde codes, respectively - we further find that many of the desirable properties of these codes transfer to the bosonic cyclic code setting. We go on to discuss the larger $SU(2)$ symmetry and rotation gates of the codes, which yield additional stabilizers and logical Pauli gates, as well as new non-Clifford gates for the smallest `kitten' binomial code, and provide a new error detection protocol. Finally, we introduce a general paradigm for converting higher-order stabilizers to logical gates, as in our generalization of rotation-symmetric codes, and apply it to several multimode bosonic codes.

quant-pharXiv:2606.11010•Jun 10, 2026•3 citations
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.
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 Q8Q_8Q8​ and the binary octahedral group 2O2O2O.
The central result is that compression of error products to the codespace is an intertwiner. Order-(L,K)(L,K)(L,K) loss-product sectors transform as SymL(ρf)⊗SymK(ρf∗)\mathrm{Sym}^L(\rho_f)\otimes\mathrm{Sym}^K(\rho_f^*)SymL(ρf​)⊗SymK(ρ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 γ=0.095\gamma=0.095γ=0.095, optimized infidelities are approximately 0.0230.0230.023 for the illustrated Q8Q_8Q8​ code and 0.00090.00090.0009 and 0.00120.00120.0012 for two 2O2O2O 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.
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. Source: http://arxiv.org/abs/2 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Given some group G of logical gates, for instance the Clifford group, what are the quantum encodings for which these logical gates can be implemented by simple physical operations, described by some physical representation of G? We study this question by constructing a general form of such encoding maps. For instance, we recover that the ⟦5,1,3⟧ and Steane codes admit transversal implementations of the binary tetrahedral and binary octahedral groups, respectively. For bosonic encodings, we show how to obtain the GKP and cat qudit encodings by considering the appropriate groups, and essentially the simplest physical implementations. We further illustrate this approach by introducing a two-mode bosonic code defined from a constellation of 48 coherent states, for which all single-qubit Clifford gates correspond to passive Gaussian unitaries.
We introduce an intrinsic formulation of quantum error correction based on representation theory, in which error-protection structure is encoded directly in a unitary group representation, rather than being tied to a particular embedding into a larger Hilbert space. In this framework, error models are classified according to the isotypic decomposition of the conjugation action on the operator algebra. Our main result, the \emph{Schur bootstrap}, shows that if an intrinsic code satisfies the Knill--Laflamme conditions on a given symmetry sector, then the same error-protection relations hold for every extrinsic realization obtained from a group-equivariant isometric embedding into a larger Hilbert space. Thus a single intrinsic verification certifies the corresponding symmetry-resolved error-correction conditions across an entire family of physical realizations. We further introduce an intrinsic notion of distance, called depth, defined via adjoint order. For standard multi-qudit systems this coincides with conventional code distance, while for more general representations it refines the usual weight-based notion. We also prove an intrinsic Eastin--Knill theorem: any intrinsic code of depth at least two has a discrete logical symmetry group, with the obstruction to continuous covariant gates arising from the representation-theoretic structure of the adjoint action. We illustrate the framework with several examples, including a minimal SU(2)\mathrm{SU}(2)SU(2) construction that unifies permutation-invariant qubit codes and bosonic codes, and higher-dimensional constructions exhibiting transversal Clifford symmetries and realizations beyond qubit systems.
Quantum error correction (QEC) is indispensable for scalable quantum computing, but implementing it with minimal hardware overhead remains a central challenge. Large spin systems with collective degrees of freedom offer a promising route to reducing the control complexity of qubit architectures while retaining a large Hilbert space for fault-tolerant encoding. However, existing proposals for logical gates and QEC in spin ensembles generally rely on inefficient higher-order interactions. Here we introduce spin-N-Cat codes, which encode logical qubits in superpositions of spin-coherent states and generalize bosonic Cat codes to the modular subspaces of permutationally symmetric spin ensembles. The code corrects collective and individual dephasing, excitation, and decay errors. We also present an efficient physical realization in central-spin systems, such as a quantum dot, where encoding, decoding, and a universal, fault-tolerant, and bias-preserving gate set are implemented using only first-order interactions. Numerical simulations demonstrate high logical fidelity under dephasing and excitation-decay noise, independent of noise bias, and that full QEC cycles are feasible with realistic microscopic parameters. For the large collective spins available in quantum dots, this translates into a substantial extension of coherence time. Our results establish spin-N-Cat codes as a scalable, hardware-efficient approach to QEC in spin-based quantum architectures.
While 2-level systems, aka qubits, are a natural choice to perform a logical quantum computation, the situation is less clear at the physical level. Encoding information in higher-dimensional physical systems can indeed provide a first level of redundancy and error correction that simplifies the overall fault-tolerant architecture. A challenge then is to ensure universal control over the encoded qubits. Here, we explore an approach where information is encoded in an irreducible representation of a finite subgroup of U ( 2 ) through an inverse quantum Fourier transform. We illustrate this idea by applying it to the real Pauli group ⟨ X , Z ⟩ in the bosonic setting. The resulting two-mode Fourier cat code displays good error correction properties and admits an experimentally-friendly universal gate set that we discuss in detail.
Bosonic codes offer hardware-efficient approaches to quantum error correction, with the best encodings offering effective protection of idle quantum information against loss and dephasing - particularly rotation-symmetric codes, which include the cat and binomial code families. However, rotation-symmetric codes are only naturally endowed with a single logical Pauli gate, while other logical gates require the use of non-linear operations, obstructing the utility of these codes for realizing quantum algorithms. Here, we balance error protection with controllability by introducing bosonic cyclic codes: a generalization of rotation-symmetric codes that enable the measured tradeoff of error protection properties for fault-tolerant logical phase gates. Through our general construction, we find that sacrificing the detectability of a single photon loss relative to a rotation-symmetric code can yield a number of logical phase gates commensurate with the original rotation symmetry order of the code, all achievable via passive Gaussian rotations. Giving the corresponding generalizations of cat and binomial codes - which we dub cyclic cat and Vandermonde codes, respectively - we further find that many of the desirable properties of these codes transfer to the bosonic cyclic code setting. We go on to discuss the larger SU(2)SU(2)SU(2) symmetry and rotation gates of the codes, which yield additional stabilizers and logical Pauli gates, as well as new non-Clifford gates for the smallest `kitten' binomial code, and provide a new error detection protocol. Finally, we introduce a general paradigm for converting higher-order stabilizers to logical gates, as in our generalization of rotation-symmetric codes, and apply it to several multimode bosonic codes.