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.
Comments
More detail about intrinsic distance (depth). Prove an intrinsic Eastin--Knill theorem. New $\mathrm{SU}(2)$ and $\mathrm{SU}(3)$ constructions
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) construction that unifies permutation-invariant qubit codes and bosonic codes, and higher-dimensional constructions exhibiting transversal Clifford symmetries and realizations beyond qubit systems.
This paper develops a MacWilliams-type enumerator theory and semidefinite programming bounds for intrinsic quantum codes. An intrinsic code is a subspace C⊂V of a finite-dimensional unitary representation V of a group G, with errors organized into the isotypic components of L(V) under conjugation. The Knill-Laflamme conditions persist under every G-equivariant realization of V, aallowing intrinsic bounds to apply across diverse physical encodings. Without a group action, we first construct projector and twirl quadratic enumerators for an arbitrary orthogonal decomposition of L(V), analogous respectively to the A and B enumerators of Shor-Laflamme theory. These enumerators satisfy positivity, normalization, and Knill-Laflamme inequalities, but the two superoperator families need not span the same space and therefore admit no canonical duality. A group action places their generalized versions in the same equivariant intertwiner algebra, and the change of basis between them defines the intrinsic MacWilliams transform. When the conjugation representation has multiplicities, this algebra is noncommutative and the enumerators are matrix-valued; positivity and detection are encoded by Loewner-order constraints, making the natural programming bound a semidefinite program. The multiplicity-free specialization recovers the known scalar MacWilliams transform and linear-programming framework. For symmetric powers, intrinsic depth equals ordinary qudit distance, yielding extremality certificates for permutation-invariant qudit codes. Finally, for the 27-dimensional SU(3) representation V=(2,2), an exact dual certificate proves the sharp bound K≤5 for codes detecting the full adjoint isotypic component. An explicit 5-dimensional code attains the bound and, under the canonical embedding, gives a four-qutrit distance-2 code.
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.
Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here, we study the compatibility of these two important principles. If a logical quantum system is encoded into n physical subsystems, we say that the code is covariant with respect to a symmetry group G if a G transformation on the logical system can be realized by performing transformations on the individual subsystems. For a G-covariant code with G a continuous group, we derive a lower bound on the error-correction infidelity following erasure of a subsystem. This bound approaches zero when the number of subsystems nor the dimension d of each subsystem is large. We exhibit codes achieving approximately the same scaling of infidelity with n or d as the lower bound. Leveraging tools from representation theory, we prove an approximate version of the Eastin-Knill theorem for quantum computation: If a code admits a universal set of transversal gates and corrects erasure with fixed accuracy, then, for each logical qubit, we need a number of physical qubits per subsystem that is inversely proportional to the error parameter. We construct codes covariant with respect to the full logical unitary group, achieving good accuracy for large d (using random codes) or n (using codes based on W states). We systematically construct codes covariant with respect to general groups, obtaining natural generalizations of qubit codes to, for instance, oscillators and rotors. In the context of the AdS/CFT correspondence, our approach provides insight into how time evolution in the bulk corresponds to time evolution on the boundary without violating the Eastin-Knill theorem, and our five-rotor code can be stacked to form a covariant holographic code.
We develop a theory of approximate quantum error correction (QEC) based on the error-set model, complemented by general methods for code construction. Exact QEC has a powerful error-set structure: by the Knill-Laflamme conditions, a code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span. This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory of asymptotically good codes. A longstanding view has been that these features do not extend to AQEC, leaving the theory essentially channel-by-channel. We show instead that, although full Knill--Laflamme linearity fails, a restricted form survives and suffices to extend all three structural features to the approximate setting. Specifically, a common error-set criterion governs families of channels whose Kraus operators are linear combinations of a given error set and whose coefficient matrices satisfy a spectral constraint. Using the Bény-Oreshkov worst-case and Petz average-case frameworks, we derive uniform fidelity guarantees for these families in terms of two new code parameters--the \emph{environment-leakage distance}, controlling worst-case performance, and the \emph{Knill-Laflamme Hellinger distance}, characterizing the average-case performance of Petz recovery.
To demonstrate the scope of this model, we develop partition-based constructions across diverse quantum systems and geometries, placing exact and approximate correction on equal footing. These constructions lead to a metric--error alignment hierarchy for Hilbert spaces, metrics, and error families, which in turn characterizes the resulting recovery guarantees. They yield the first known asymptotically good code families for fermionic systems, one-dimensional Rydberg-blockaded systems, and deletion errors, and extend to other physical platforms.
Quantum error correction compatible with continuous symmetries is a fundamental problem in quantum information and a possible route to robust analog quantum simulation. Because the Eastin-Knill theorem forbids exact codes with continuous transversal symmetries, we construct explicit SU(d)-covariant approximate codes that exploit permutation symmetry to spread logical information uniformly across all physical subsystems. For one-, two-, and three-qudit erasures at known locations, we prove worst-case purified-distance scaling O(1/N), which matches known approximate Eastin-Knill lower bounds up to constants, and we extend the reduced-state analysis to general flagged local noise. Exact permutation symmetry of this kind is available only up to three erased sites; for an arbitrary fixed number k of erased sites, we instead show that Haar-random and efficiently sampled encodings achieve worst-case distance O(k/N) with probability exponentially close to one. For single-qudit erasure, we construct an explicit near-optimal decoder from the Petz recovery map. We then use these codes as building blocks for encoded analog dynamics. Symmetry-preserving Hamiltonians generate block-structured dynamical Lie algebras implementable transversally, while controlled symmetry-breaking terms serve as non-transversal resources for universal dynamics. These results provide explicit non-Abelian covariant codes and a framework for robust analog quantum simulation.
Dynamical decoupling is a long-established and effective way to suppress unwanted interactions in qubit systems, enabling advances in fields ranging from quantum metrology to quantum computing. For general qudit systems, however, comparable protocols remain rare, mainly because Hamiltonian engineering in higher dimensions lacks the geometric intuition available for qubits. Here we present a general framework for dynamical decoupling in qudit systems, based on Lie group representation theory. By extending the group theory approach to dynamical decoupling, we show how decoupling groups can be systematically identified among the finite subgroups of SU(d) by analyzing their access to the irreducible components of the operator space. As an application, we construct new pulse sequences for interacting qutrit systems based on finite subgroups of SU(3), and show how subgroup factorizations and group orientations can be exploited to obtain shorter and more experimentally practical protocols for spin-1 systems with large zero-field splitting. We further show that the same symmetry-based framework yields quantum error-correcting codes: whenever a finite subgroup of SU(d) acts as a decoupling group for the relevant set of operators, the associated one-dimensional symmetry sectors define codespaces satisfying the Knill-Laflamme conditions, thereby unifying dynamical decoupling and quantum error correction in multi-level quantum systems.