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.19162

Holomorphic Quantum Error Correction Codes

M. W. AlMasri

quant-phSubmitted Aug 25, 2026• Announced Aug 26, 2026• 0 citations
arXivHTMLPDF

Abstract

We develop a holomorphic representation of quantum error correction codes (QECCs) within the Segal--Bargmann space. By encoding qubits into Schwinger boson modes $(z_{a_j}, z_{b_j})$ subject to a degree-one homogeneity constraint, we derive closed-form differential operator representations for stabilizers, syndrome extraction, and recovery for fundamental codes (three-, five-, seven-, and nine-qubit codes). Quantum errors are characterized as holomorphic perturbations violating this constraint, while syndrome measurement projects onto eigenspaces of commuting differential operators. Restricting to unit-magnitude variables ($|z|=1$) reveals a toroidal space $\T^{2n}$ where error syndromes manifest as discrete translations in winding number space $\Z^{2n}$, and recovery acts as Hamiltonian flows restoring the winding configuration. In the full Segal--Bargmann space, the code space is a holomorphic submanifold of $\CP^{2^n-1}$, with correctable errors as transverse normal directions. Consequently, the Knill--Laflamme condition becomes a Fubini--Study orthogonality condition between the code submanifold and its error-translated images. Topological protection emerges from the $U(1)^n$ fiber bundle structure: global phase noise along fibers is unobservable, while base-space errors require active correction. Finally, we establish a path-integral formulation for semiclassical error correction dynamics and show that geometric entanglement via the Segre embedding naturally quantifies code distance. This framework unifies algebraic, geometric, and topological perspectives on fault-tolerant quantum protocols.

Comments
43 pages

Related papers

Spectral Codes: A Geometric Formalism for Quantum Error Correction

Satoshi Kanno, Yoshi-aki Shimada

We present a new geometric perspective on quantum error correction based on spectral triples in noncommutative geometry. In this approach, quantum error correcting codes are reformulated as low energy spectral projections of Dirac type operators that separate global logical degrees of freedom from local, correctable errors. Locality, code distance, and the Knill Laflamme condition acquire a unified spectral and geometric interpretation in terms of the induced metric and spectrum of the Dirac operator. Within this framework, a wide range of known error correcting codes including classical linear codes, stabilizer codes, GKP type codes, and topological codes are recovered from a single construction. This demonstrates that classical and quantum codes can be organized within a common geometric language. A central advantage of the spectral triple perspective is that the performance of error correction can be directly related to spectral properties. We show that leakage out of the code space is controlled by the spectral gap of the Dirac operator, and that code preserving internal perturbations can systematically increase this gap without altering the encoded logical subspace. This yields a geometric mechanism for enhancing error correction thresholds, which we illustrate explicitly for a stabilizer code. We further interpret Berezin Toeplitz quantization as a mixed spectral code and briefly discuss implications for holographic quantum error correction. Overall, our results suggest that quantum error correction can be viewed as a universal low energy phenomenon governed by spectral geometry.

quant-pharXiv:2601.19765•Jan 28, 2026•0 citations

From Bounded Surjections to Quantum Error-Correcting Codes: An Operator-Algebraic Construction

Sudoma, Oksana

Abstract We establish that every bounded surjection π : B ↠ H between Banach and Hilbertspaces canonically induces a quantum error-correcting code structure. The kernel ker π capturesunobservable degrees of freedom, while the quotient B/ ker π encodes protected logical information.This perspective: (1) unifies subspace, subsystem, and operator-algebraic codes under oneframework; (2) provides functorial code transformations via morphisms of surjections; (3)enables computational exploration through kernel geometry analysis; (4) extends naturally toinfinite dimensions via GNS construction without requiring infinite stabilizer sets. We prove thecorrespondence is functorial with a universal property, demonstrate stability under perturbations,and show the Knill-Laflamme conditions emerge from kernel structure. Examples include theShor code arising from syndrome extraction, holographic codes from bulk-boundary maps, andoperator-algebraic codes from GNS representations. Computational validation (ExperimentsE49, E50) confirms kernel dimension predictions with machine-precision accuracy and revealsrank transition behavior in continuous code families, with dimension derivatives |∆k/∆t| ∼ 102at transition points. While finite-dimensional codes are mathematically equivalent to knownconstructions, our framework provides conceptual unification: (1) kernel geometry explains whydifferent QEC approaches converge on the same codes; (2) continuous code families handle ranktransitions without stabilizer redefinition; (3) infinite dimensions via GNS construction avoidinfinite stabilizer sets; (4) functorial transformations arise naturally from surjection morphisms;(5) the approach aligns with physical intuition—error correction protects exactly the informationthat survives observation. Where Surjections Appear Naturally Quantum error correction typically starts with a codespace—a carefully chosen subspace of a larger Hilbert space [ KL97, NC10 , Got97 ]. But nature oftenpresents us with projection maps first:• Coarse-graining: Mapping microscopic states to macroscopic observables• Symmetry reduction: Projecting onto gauge-invariant subspaces• Partial trace: Observing subsystems of composite quantum states• Boundary limits: In AdS/CFT, mapping bulk fields to boundary observablesEach scenario involves a map from a larger space to a smaller observable space. Informationthat survives this projection is precisely what remains accessible. The question naturally arises:Can these projections automatically induce quantum error-correcting structure? This paper answers affirmatively: every bounded surjection canonically induces quantumerror correction structure. The construction applies broadly—from finite qubit codes to infinite-dimensional operator algebras. Consider the concrete scenario of holographic duality: bulk quantum fields map to boundaryCFT observables. Some bulk configurations are invisible from the boundary—they lie in the kernelof the bulk-to-boundary map. The observable bulk information forms a quotient space. Could thisquotient structure automatically define error correction? Our Contribution We prove that every bounded surjection π : B ↠ H from a Banach space ontoa Hilbert space canonically induces a quantum error-correcting code via the quotient constructionfrom functional analysis [Rud91, Con90]. The construction is:1. Universal: Works for finite and infinite-dimensional systems2. Natural: QEC emerges from observability structure (kernel geometry)3. Functorial: Morphisms between surjections induce code transformations Positioning in the Literature This work occupies a unique position at the intersection of threeapproaches to quantum error correction:• vs. Stabilizer QEC [Got97 ]: We provide a dual perspective where codes emerge fromobservables (what we can measure) rather than symmetries (what commutes). This isconceptually inverse but mathematically equivalent in finite dimensions.• vs. Operator Algebra QEC [ KLP05, Pou05 , KL24]: While OAQEC uses von Neumannalgebras to generalize stabilizers, we use surjections to generalize projections. Our frameworkencompasses OAQEC as the special case where B carries algebra structure (Proposition 4).• vs. Holographic QEC [ ADH15, PYHP15]: Holographic codes implicitly use bulk-to-boundary maps. We make this explicit, showing these maps are surjections whose kernelsencode gauge redundancy. Our Contribution We do not claim new codes but rather a unifying framework that:1. Explains why these approaches converge on the same codes (they all induce surjections)2. Provides computational tools via kernel geometry analysis3. Enables systematic code exploration by designing surjections rather than searching for stabi-lizers4. Naturally extends to infinite dimensions where stabilizers become unwieldyThe key insight: error correction is fundamentally about preserving observable information underlimited measurement resolution—the kernel captures what’s unmeasurable, the quotient preserveswhat survives. Experiments E49: Kernel Geometry Visualization Validates [[4,2,2]] quantum code construction from bounded surjections. Key results: Code distance d=2 verified Kernel orthogonality: 10^-16 (machine precision) Logical operators detected Runtime: < 1 second Documentation: See experiments/E49_kernel_geometry_viz/ABOUT_THIS_EXPERIMENT.md for complete research narrative (hypothesis → results → interpretation) on https://github.com/boonespacedog/surjection-to-qec.git . Quick start: cd experiments/E49_kernel_geometry_viz python3 -m venv venv source venv/bin/activate pip install -r requirements.txt python3 main.py E50: Functorial Code Morphisms Continuous code family evolution with rank transition detection. Key results: Rank transitions detected at t = 2^n - 1 (discrete phase transitions!) Dimension jumps: |Δdim/Δt| = 198 at critical points Topological protection discovered (codes resist smooth deformation) Runtime: ~1.5 seconds Documentation: See experiments/E50_functorial_code_morphisms/ABOUT_THIS_EXPERIMENT.md for complete research narrative and link to topological interpretations on https://github.com/boonespacedog/surjection-to-qec.git .

•Nov 15, 2025•0 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•0 citations

A diagrammatic field theory of quantum error correction

Steven Rayan

We develop a field-theoretic framework for quantum error correction centred on fusion-space codes in unitary fusion categories. Admissible clusters determine total-charge sectors and orthogonal footprint projectors recording locally visible data left by error histories. The central distinction is between diagnostic footprint algebras and syndrome-admissible commuting algebras: the latter can be measured without revealing logical information and resolve chosen error representatives into measured sectors. For such algebras, exact correctability is equivalent to fibrewise Knill--Laflamme conditions, yielding a measure-then-recover factorization. Under a contractible-vacuum locality hypothesis, closed neutral composites give a categorical sufficient criterion for scalar action on the code. In the Ising theory, four $σ$ punctures show that pair-charge footprints can be complementary logical diagnostics and realize an exact one-qubit Clifford shadow. A proper six-$σ$ code instead admits a syndrome-admissible pair-charge measurement and exact recovery from an explicit Majorana bilinear error. A second bilinear has the same measured footprint but differs by a logical bit flip, producing a concrete nontrivial footprint fibre and genuine decoding ambiguity. We also formulate conformal-block likelihood data and compute geometry-dependent Ising four-point weights. For growing code families, we prove a conditional Peierls-type threshold theorem: bounded connected-region growth, local stochastic noise, local neutralizability of small residual components, and componentwise decoder balance imply $\Pr_L(\mathrm{fail})\le C|Ω_L|e^{-cL}$ below a nonzero constant error rate. We conclude with representation-theoretic and algebro-geometric directions involving tube and Hopf algebras, Yangian-type structures, Higgs bundles, spectral curves, Jacobians, and abelian varieties.

quant-pharXiv:2607.08911•Jul 13, 2026•0 citations

Homomorphic Quantum Error Correction

Kornikar Sen, Miguel A. Martin-Delgado

We study the algebraic compatibility between quantum homomorphic encryption and stabilizer quantum error correction in an honest-but-curious model, restricting the encryption to the transversal block-Pauli mask $(X^aZ^b)^{\otimes n}$ controlled by two secret key bits $a$ and $b$. We prove a necessary and sufficient criterion for an $[[n,1,d]]$ stabilizer code to remain compatible with this mask, namely that the transversal $X$ and $Z$ operators commute with every stabilizer generator, and we specialize it to a classical-code criterion for Calderbank--Shor--Steane codes. Combining code-space preservation with the logical action of the mask, every stabilizer code falls, with respect to each of the two transversal mask operators, into exactly one of three classes: incompatible, compatible but trivially acting, or compatible with a nontrivial logical Pauli action; the two operators need not fall into the same class. We verify this classification by exact symplectic computation for rotated and planar surface codes, toric codes, triangular and toric color codes, the $[[15,1,3]]$ code and several small codes, and find that the class is fixed by the lattice size and the boundary presentation rather than by the topological phase: the surface-code family realizes all three classes, whereas color codes realize only the two compatible ones. For encrypted computation we show that the Shor code does not implement the logical $T$ gate by a transversal $T^{\otimes 9}$, whereas suitable triorthogonal codes do so up to a Clifford correction. We formulate logical-Pauli masking as a code-independent algebraic template. Syndrome extraction and recovery are key-independent whenever the mask preserves the code space, so that the client only needs the block size and the class of the code to decrypt.

quant-pharXiv:2605.25692•May 26, 2026•0 citations

Quantum error correction and fault tolerance: A comprehensive tutorial

Daniel J. Spencer, Shubham P. Jain, Andrew Tanggara +4 more

Noise is one of the central obstacles to building useful quantum computers, and quantum error correction (QEC) provides the framework for protecting quantum information against it. Unlike classical error correction, QEC must preserve fragile quantum states without copying them, measuring them directly, or destroying the information they encode. Driven by rapid progress in both theory and experiment, this challenge has grown into one of the most active areas of quantum information science. This tutorial gives a guided introduction to modern QEC, developing the core concepts of codes, syndromes, stabilizers, decoding, and fault tolerance before connecting them to major code families and current research directions. We cover both established constructions and newer developments, including topological and subsystem codes, bosonic and qudit codes, dynamical codes, and quantum low-density parity-check (qLDPC) codes. The emphasis is on building operational understanding: explaining not only what the main objects are, but how they are used in code design, error diagnosis, decoding, and fault-tolerant computation. The tutorial is intended for newcomers seeking a first path through QEC, as well as researchers looking for a coherent reference for the concepts, code families, and tools that arise in current work.

quant-pharXiv:2605.29137•May 29, 2026•0 citations
We develop a holomorphic representation of quantum error correction codes (QECCs) within the Segal--Bargmann space. By encoding qubits into Schwinger boson modes (zaj,zbj)(z_{a_j}, z_{b_j})(zaj​​,zbj​​) subject to a degree-one homogeneity constraint, we derive closed-form differential operator representations for stabilizers, syndrome extraction, and recovery for fundamental codes (three-, five-, seven-, and nine-qubit codes). Quantum errors are characterized as holomorphic perturbations violating this constraint, while syndrome measurement projects onto eigenspaces of commuting differential operators. Restricting to unit-magnitude variables (∣z∣=1|z|=1∣z∣=1) reveals a toroidal space \T2n\T^{2n}\T2n where error syndromes manifest as discrete translations in winding number space Z2n\Z^{2n}Z2n, and recovery acts as Hamiltonian flows restoring the winding configuration. In the full Segal--Bargmann space, the code space is a holomorphic submanifold of \CP2n−1\CP^{2^n-1}\CP2n−1, with correctable errors as transverse normal directions. Consequently, the Knill--Laflamme condition becomes a Fubini--Study orthogonality condition between the code submanifold and its error-translated images. Topological protection emerges from the U(1)nU(1)^nU(1)n fiber bundle structure: global phase noise along fibers is unobservable, while base-space errors require active correction. Finally, we establish a path-integral formulation for semiclassical error correction dynamics and show that geometric entanglement via the Segre embedding naturally quantifies code distance. This framework unifies algebraic, geometric, and topological perspectives on fault-tolerant quantum protocols.
We present a new geometric perspective on quantum error correction based on spectral triples in noncommutative geometry. In this approach, quantum error correcting codes are reformulated as low energy spectral projections of Dirac type operators that separate global logical degrees of freedom from local, correctable errors. Locality, code distance, and the Knill Laflamme condition acquire a unified spectral and geometric interpretation in terms of the induced metric and spectrum of the Dirac operator. Within this framework, a wide range of known error correcting codes including classical linear codes, stabilizer codes, GKP type codes, and topological codes are recovered from a single construction. This demonstrates that classical and quantum codes can be organized within a common geometric language. A central advantage of the spectral triple perspective is that the performance of error correction can be directly related to spectral properties. We show that leakage out of the code space is controlled by the spectral gap of the Dirac operator, and that code preserving internal perturbations can systematically increase this gap without altering the encoded logical subspace. This yields a geometric mechanism for enhancing error correction thresholds, which we illustrate explicitly for a stabilizer code. We further interpret Berezin Toeplitz quantization as a mixed spectral code and briefly discuss implications for holographic quantum error correction. Overall, our results suggest that quantum error correction can be viewed as a universal low energy phenomenon governed by spectral geometry.
Abstract We establish that every bounded surjection π : B ↠ H between Banach and Hilbertspaces canonically induces a quantum error-correcting code structure. The kernel ker π capturesunobservable degrees of freedom, while the quotient B/ ker π encodes protected logical information.This perspective: (1) unifies subspace, subsystem, and operator-algebraic codes under oneframework; (2) provides functorial code transformations via morphisms of surjections; (3)enables computational exploration through kernel geometry analysis; (4) extends naturally toinfinite dimensions via GNS construction without requiring infinite stabilizer sets. We prove thecorrespondence is functorial with a universal property, demonstrate stability under perturbations,and show the Knill-Laflamme conditions emerge from kernel structure. Examples include theShor code arising from syndrome extraction, holographic codes from bulk-boundary maps, andoperator-algebraic codes from GNS representations. Computational validation (ExperimentsE49, E50) confirms kernel dimension predictions with machine-precision accuracy and revealsrank transition behavior in continuous code families, with dimension derivatives |∆k/∆t| ∼ 102at transition points. While finite-dimensional codes are mathematically equivalent to knownconstructions, our framework provides conceptual unification: (1) kernel geometry explains whydifferent QEC approaches converge on the same codes; (2) continuous code families handle ranktransitions without stabilizer redefinition; (3) infinite dimensions via GNS construction avoidinfinite stabilizer sets; (4) functorial transformations arise naturally from surjection morphisms;(5) the approach aligns with physical intuition—error correction protects exactly the informationthat survives observation. Where Surjections Appear Naturally Quantum error correction typically starts with a codespace—a carefully chosen subspace of a larger Hilbert space [ KL97, NC10 , Got97 ]. But nature oftenpresents us with projection maps first:• Coarse-graining: Mapping microscopic states to macroscopic observables• Symmetry reduction: Projecting onto gauge-invariant subspaces• Partial trace: Observing subsystems of composite quantum states• Boundary limits: In AdS/CFT, mapping bulk fields to boundary observablesEach scenario involves a map from a larger space to a smaller observable space. Informationthat survives this projection is precisely what remains accessible. The question naturally arises:Can these projections automatically induce quantum error-correcting structure? This paper answers affirmatively: every bounded surjection canonically induces quantumerror correction structure. The construction applies broadly—from finite qubit codes to infinite-dimensional operator algebras. Consider the concrete scenario of holographic duality: bulk quantum fields map to boundaryCFT observables. Some bulk configurations are invisible from the boundary—they lie in the kernelof the bulk-to-boundary map. The observable bulk information forms a quotient space. Could thisquotient structure automatically define error correction? Our Contribution We prove that every bounded surjection π : B ↠ H from a Banach space ontoa Hilbert space canonically induces a quantum error-correcting code via the quotient constructionfrom functional analysis [Rud91, Con90]. The construction is:1. Universal: Works for finite and infinite-dimensional systems2. Natural: QEC emerges from observability structure (kernel geometry)3. Functorial: Morphisms between surjections induce code transformations Positioning in the Literature This work occupies a unique position at the intersection of threeapproaches to quantum error correction:• vs. Stabilizer QEC [Got97 ]: We provide a dual perspective where codes emerge fromobservables (what we can measure) rather than symmetries (what commutes). This isconceptually inverse but mathematically equivalent in finite dimensions.• vs. Operator Algebra QEC [ KLP05, Pou05 , KL24]: While OAQEC uses von Neumannalgebras to generalize stabilizers, we use surjections to generalize projections. Our frameworkencompasses OAQEC as the special case where B carries algebra structure (Proposition 4).• vs. Holographic QEC [ ADH15, PYHP15]: Holographic codes implicitly use bulk-to-boundary maps. We make this explicit, showing these maps are surjections whose kernelsencode gauge redundancy. Our Contribution We do not claim new codes but rather a unifying framework that:1. Explains why these approaches converge on the same codes (they all induce surjections)2. Provides computational tools via kernel geometry analysis3. Enables systematic code exploration by designing surjections rather than searching for stabi-lizers4. Naturally extends to infinite dimensions where stabilizers become unwieldyThe key insight: error correction is fundamentally about preserving observable information underlimited measurement resolution—the kernel captures what’s unmeasurable, the quotient preserveswhat survives. Experiments E49: Kernel Geometry Visualization Validates [[4,2,2]] quantum code construction from bounded surjections. Key results: Code distance d=2 verified Kernel orthogonality: 10^-16 (machine precision) Logical operators detected Runtime: < 1 second Documentation: See experiments/E49_kernel_geometry_viz/ABOUT_THIS_EXPERIMENT.md for complete research narrative (hypothesis → results → interpretation) on https://github.com/boonespacedog/surjection-to-qec.git . Quick start: cd experiments/E49_kernel_geometry_viz python3 -m venv venv source venv/bin/activate pip install -r requirements.txt python3 main.py E50: Functorial Code Morphisms Continuous code family evolution with rank transition detection. Key results: Rank transitions detected at t = 2^n - 1 (discrete phase transitions!) Dimension jumps: |Δdim/Δt| = 198 at critical points Topological protection discovered (codes resist smooth deformation) Runtime: ~1.5 seconds Documentation: See experiments/E50_functorial_code_morphisms/ABOUT_THIS_EXPERIMENT.md for complete research narrative and link to topological interpretations on https://github.com/boonespacedog/surjection-to-qec.git .
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.
We develop a field-theoretic framework for quantum error correction centred on fusion-space codes in unitary fusion categories. Admissible clusters determine total-charge sectors and orthogonal footprint projectors recording locally visible data left by error histories. The central distinction is between diagnostic footprint algebras and syndrome-admissible commuting algebras: the latter can be measured without revealing logical information and resolve chosen error representatives into measured sectors. For such algebras, exact correctability is equivalent to fibrewise Knill--Laflamme conditions, yielding a measure-then-recover factorization. Under a contractible-vacuum locality hypothesis, closed neutral composites give a categorical sufficient criterion for scalar action on the code. In the Ising theory, four σσσ punctures show that pair-charge footprints can be complementary logical diagnostics and realize an exact one-qubit Clifford shadow. A proper six-σσσ code instead admits a syndrome-admissible pair-charge measurement and exact recovery from an explicit Majorana bilinear error. A second bilinear has the same measured footprint but differs by a logical bit flip, producing a concrete nontrivial footprint fibre and genuine decoding ambiguity. We also formulate conformal-block likelihood data and compute geometry-dependent Ising four-point weights. For growing code families, we prove a conditional Peierls-type threshold theorem: bounded connected-region growth, local stochastic noise, local neutralizability of small residual components, and componentwise decoder balance imply Pr⁡L(fail)≤C∣ΩL∣e−cL\Pr_L(\mathrm{fail})\le C|Ω_L|e^{-cL}PrL​(fail)≤C∣ΩL​∣e−cL below a nonzero constant error rate. We conclude with representation-theoretic and algebro-geometric directions involving tube and Hopf algebras, Yangian-type structures, Higgs bundles, spectral curves, Jacobians, and abelian varieties.
We study the algebraic compatibility between quantum homomorphic encryption and stabilizer quantum error correction in an honest-but-curious model, restricting the encryption to the transversal block-Pauli mask (XaZb)⊗n(X^aZ^b)^{\otimes n}(XaZb)⊗n controlled by two secret key bits aaa and bbb. We prove a necessary and sufficient criterion for an [[n,1,d]][[n,1,d]][[n,1,d]] stabilizer code to remain compatible with this mask, namely that the transversal XXX and ZZZ operators commute with every stabilizer generator, and we specialize it to a classical-code criterion for Calderbank--Shor--Steane codes. Combining code-space preservation with the logical action of the mask, every stabilizer code falls, with respect to each of the two transversal mask operators, into exactly one of three classes: incompatible, compatible but trivially acting, or compatible with a nontrivial logical Pauli action; the two operators need not fall into the same class. We verify this classification by exact symplectic computation for rotated and planar surface codes, toric codes, triangular and toric color codes, the [[15,1,3]][[15,1,3]][[15,1,3]] code and several small codes, and find that the class is fixed by the lattice size and the boundary presentation rather than by the topological phase: the surface-code family realizes all three classes, whereas color codes realize only the two compatible ones. For encrypted computation we show that the Shor code does not implement the logical TTT gate by a transversal T⊗9T^{\otimes 9}T⊗9, whereas suitable triorthogonal codes do so up to a Clifford correction. We formulate logical-Pauli masking as a code-independent algebraic template. Syndrome extraction and recovery are key-independent whenever the mask preserves the code space, so that the client only needs the block size and the class of the code to decrypt.
Noise is one of the central obstacles to building useful quantum computers, and quantum error correction (QEC) provides the framework for protecting quantum information against it. Unlike classical error correction, QEC must preserve fragile quantum states without copying them, measuring them directly, or destroying the information they encode. Driven by rapid progress in both theory and experiment, this challenge has grown into one of the most active areas of quantum information science. This tutorial gives a guided introduction to modern QEC, developing the core concepts of codes, syndromes, stabilizers, decoding, and fault tolerance before connecting them to major code families and current research directions. We cover both established constructions and newer developments, including topological and subsystem codes, bosonic and qudit codes, dynamical codes, and quantum low-density parity-check (qLDPC) codes. The emphasis is on building operational understanding: explaining not only what the main objects are, but how they are used in code design, error diagnosis, decoding, and fault-tolerant computation. The tutorial is intended for newcomers seeking a first path through QEC, as well as researchers looking for a coherent reference for the concepts, code families, and tools that arise in current work.