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

A diagrammatic field theory of quantum error correction

Steven Rayan

quant-phhep-thmath-phmath.AGmath.RTSubmitted Jul 9, 2026• Announced Jul 13, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Comments
69 pages, 6 figures, 4 tables

Related papers

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

Footprints, Fibres, and the ISA Chain Complex: Diagrammatic Quantum Error Correction as H^k Cohomology

Ian Richard C Buckley

Rayan (arXiv:2607.08911) introduces a diagrammatic field theory of quantum error correction (QEC) in which syndromes are measured footprints of error configurations. We show that this framework is an instance of the ISA chain complex C^k = direct-sum_{|v|=k} A^{otimes c(v)}, with differential partial satisfying partial^2 = 0 from the Frobenius identity and pentagon relation. Two theorems are proved: Theorem A (fibrewise locality) shows that the complex splits over syndrome fibres, each satisfying partial^2 = 0 independently. Theorem B (Peierls threshold) gives beta*(P) = kappa^{-1} log(1/(2Bn_B(P))), making the ISA threshold computable from the BIND count. The Forge ISA is identified as an interpolating decoder family between the topological (sigma to infinity) and conformal (sigma = 0) limits, with optimal sigma* given by the MGE saddle point. A conjecture is stated that the spectral curve of the decoding problem equals the divisor of beta* snaps in the complex beta-plane.

•Jul 15, 2026•0 citations

Holomorphic Quantum Error Correction Codes

M. W. AlMasri

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.

quant-pharXiv:2609.19162•Aug 26, 2026•0 citations

Code-Visible Liouvillian Modes and Coherent Logical Errors in Quantum Codes

Marina Gordeychuk, Oleg Kiselev

Coherent Hamiltonian drifts and systematic errors can pass through quantum error correction differently than stochastic Pauli noise: they generate phase components of the logical channel that are lost under full Pauli twirling. We consider the Lindbladian dynamics of \(n\) physical qubits propagated through an effective logical channel of a fixed encoding, recovery, and decoding scheme. The work is methodological in character: standard ideas of observability and minimal realization from linear systems theory are applied to the channel \[ ω \mapsto Φ_t(ω) = \cD e^{t\cL}\cE(ω), \] where \(\cE\) encodes the logical state and \(\cD\) is the chosen recovery map with final decoding. The minimal code-visible space \(\cK_{\rm code}\) is defined as the Krylov closure of the decodable logical observables with respect to \(\cL^\dagger\); its observable factorization yields a minimal realization of the logical channel. In this form, the Knill--Laflamme conditions serve as a short-time consistency check, Pauli noise on stabilizer codes reduces to a chain on syndrome-logical classes, and the choice of recovery map acts as a spectral filter on the visible modes. For quantum memory, the same language yields an estimate of the storage time in terms of the dominant visible eigenvalues of the logical channel of the correction cycle. Particular attention is paid to the spectral signatures of coherent noise and to how these signatures depend on the chosen decoder.

quant-pharXiv:2609.18978•Jul 20, 2026•0 citations

Quantum Error Source and Channel Coding

Dennis G. Lucarelli

Quantum error correction draws many of its principles and constructions from classical coding theory, adapted to the unique aspects of quantum mechanics. Here we extend this correspondence to a block of logical qubits, each prepared in the same quantum code, by coupling the block through a classical error correcting code: syndrome qubits then carry error information from several logical qubits at once, and collective inference recovers the errors. Algebraically, the construction defines subgroups of the product stabilizer group corresponding to duals of classical codes, and we prove that a lookup table decoder corrects every error pattern respecting the correction radii of the two constituent codes. For classical algebraic code families, the number of syndrome qubits serving $L$ logical qubits scales as ${\cal O}(\log_2(L+1))$ at the code-capacity level, though at the price of stabilizer weight growing with the block length. An entropy bound shows that check weights need not grow with $L$. Under a phenomenological noise model, the same lookup table identifies measurement errors by nearest-neighbor post-processing, and classical algebraic decoders locate exactly the logical qubits carrying errors even with noisy syndromes. More broadly, we argue that quantum error correction, reduced to its functional core, is source compression in the sense of Shannon, whose source and channel coding theorems bound the overhead rates of quantum post-selection tasks.

arXiv:2004.09479•Apr 20, 2020•0 citations

Fusion-assisted decoding of non-Abelian topological order

Rohith Sajith, Yabo Li, Zijian Song +2 more

Maximum likelihood (ML) decoders perform quantum error correction by measuring a set of syndromes, classically computing an optimal recovery based on these syndromes and the noise model, and then performing that recovery. ML decoders are well understood for the toric code and generalize straightforwardly to other surface codes with Abelian anyons, where they can saturate information-theoretic decoding thresholds. On the other hand, codes with non-Abelian anyons have become increasingly relevant because they can support transversal or constant-depth non-Clifford gates and admit efficient preparation protocols in modern quantum devices. However, they present new challenges for decoding: non-Abelian anyons cannot in general be deterministically annihilated, and the logical operators cannot be classified by Abelian homology. In this work, we show that refined syndrome sets, including measurements that resolve non-Abelian anyon fusion outcomes, systematically improve the performance of ML decoders. We demonstrate this concretely by constructing explicit decoders for the $D_4$ quantum double model under charge noise, and obtaining numerical results for thresholds via mappings to classical statistical-mechanics models. We show that there is a nonzero noise threshold below which the entire logical qudit can be recovered with a single round of measurements.

quant-pharXiv:2610.05901•Oct 6, 2026•0 citations
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 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.
Rayan (arXiv:2607.08911) introduces a diagrammatic field theory of quantum error correction (QEC) in which syndromes are measured footprints of error configurations. We show that this framework is an instance of the ISA chain complex C^k = direct-sum_{|v|=k} A^{otimes c(v)}, with differential partial satisfying partial^2 = 0 from the Frobenius identity and pentagon relation. Two theorems are proved: Theorem A (fibrewise locality) shows that the complex splits over syndrome fibres, each satisfying partial^2 = 0 independently. Theorem B (Peierls threshold) gives beta*(P) = kappa^{-1} log(1/(2Bn_B(P))), making the ISA threshold computable from the BIND count. The Forge ISA is identified as an interpolating decoder family between the topological (sigma to infinity) and conformal (sigma = 0) limits, with optimal sigma* given by the MGE saddle point. A conjecture is stated that the spectral curve of the decoding problem equals the divisor of beta* snaps in the complex beta-plane.
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 $\T^{2n}$ 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 $\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)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.
Coherent Hamiltonian drifts and systematic errors can pass through quantum error correction differently than stochastic Pauli noise: they generate phase components of the logical channel that are lost under full Pauli twirling. We consider the Lindbladian dynamics of nnn physical qubits propagated through an effective logical channel of a fixed encoding, recovery, and decoding scheme. The work is methodological in character: standard ideas of observability and minimal realization from linear systems theory are applied to the channel \[ ω \mapsto Φ_t(ω) = \cD e^{t\cL}\cE(ω), \] where \(\cE\) encodes the logical state and \(\cD\) is the chosen recovery map with final decoding. The minimal code-visible space \(\cK_{\rm code}\) is defined as the Krylov closure of the decodable logical observables with respect to \(\cL^\dagger\); its observable factorization yields a minimal realization of the logical channel. In this form, the Knill--Laflamme conditions serve as a short-time consistency check, Pauli noise on stabilizer codes reduces to a chain on syndrome-logical classes, and the choice of recovery map acts as a spectral filter on the visible modes. For quantum memory, the same language yields an estimate of the storage time in terms of the dominant visible eigenvalues of the logical channel of the correction cycle. Particular attention is paid to the spectral signatures of coherent noise and to how these signatures depend on the chosen decoder.
Quantum error correction draws many of its principles and constructions from classical coding theory, adapted to the unique aspects of quantum mechanics. Here we extend this correspondence to a block of logical qubits, each prepared in the same quantum code, by coupling the block through a classical error correcting code: syndrome qubits then carry error information from several logical qubits at once, and collective inference recovers the errors. Algebraically, the construction defines subgroups of the product stabilizer group corresponding to duals of classical codes, and we prove that a lookup table decoder corrects every error pattern respecting the correction radii of the two constituent codes. For classical algebraic code families, the number of syndrome qubits serving LLL logical qubits scales as O(log⁡2(L+1)){\cal O}(\log_2(L+1))O(log2​(L+1)) at the code-capacity level, though at the price of stabilizer weight growing with the block length. An entropy bound shows that check weights need not grow with LLL. Under a phenomenological noise model, the same lookup table identifies measurement errors by nearest-neighbor post-processing, and classical algebraic decoders locate exactly the logical qubits carrying errors even with noisy syndromes. More broadly, we argue that quantum error correction, reduced to its functional core, is source compression in the sense of Shannon, whose source and channel coding theorems bound the overhead rates of quantum post-selection tasks.
Maximum likelihood (ML) decoders perform quantum error correction by measuring a set of syndromes, classically computing an optimal recovery based on these syndromes and the noise model, and then performing that recovery. ML decoders are well understood for the toric code and generalize straightforwardly to other surface codes with Abelian anyons, where they can saturate information-theoretic decoding thresholds. On the other hand, codes with non-Abelian anyons have become increasingly relevant because they can support transversal or constant-depth non-Clifford gates and admit efficient preparation protocols in modern quantum devices. However, they present new challenges for decoding: non-Abelian anyons cannot in general be deterministically annihilated, and the logical operators cannot be classified by Abelian homology. In this work, we show that refined syndrome sets, including measurements that resolve non-Abelian anyon fusion outcomes, systematically improve the performance of ML decoders. We demonstrate this concretely by constructing explicit decoders for the D4D_4D4​ quantum double model under charge noise, and obtaining numerical results for thresholds via mappings to classical statistical-mechanics models. We show that there is a nonzero noise threshold below which the entire logical qudit can be recovered with a single round of measurements.