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

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

Ian Richard C Buckley

Published Jul 15, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.21372998

Related papers

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•3 citations

Quantum Error Correction as Parallel Transport on the Grassmannian

Ian Richard C Buckley

Shows that stabiliser QEC has a natural geometric home on the Grassmannian Gr(2^k,2^n). Code subspace = point, distance = geodesic, syndrome = boundary map, logical gates = loops, threshold = beta* snap. Eastin-Knill theorem derived as pi_2(Gr)=Z obstruction requiring BIND.

•Jul 9, 2026•0 citations

The Kitaev Menagerie in the Forge: Topological Phases, Anyon F-Matrices, and the ISA Hierarchy

Ian Richard C Buckley

PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested. We show that Kitaev's topological phases — the toric code, the gapless Dirac cone, and the non-Abelian phase — are three computational phases of the Forge instruction-set architecture (ISA), distinguished by opcode mix and inverse-temperature scheduling via the THERMAL compiler directive. The central result is a pair of exact identities. The F-matrix of Ising anyons equals the j = 1/2 recoupling coefficient of the quantum group SU(2)₂ at q = exp(iπ/4). The F-matrix of Fibonacci anyons equals the j = 1/2 coefficient of SU(2)₃ at q = exp(iπ/5). Both identities are verified numerically. In each case the deformation parameter q = exp(iπ/(k+2)) equals exp(iπβ), where β is the Forge ISA inverse temperature, placing topological quantum computation at finite β in the semiring-deformation interpolating family of the Maslov–Gibbs programme. Three consequences follow: (i) The ISA containment hierarchy ZX ⊂ Origami ISA ⊂ 731-ISA maps exactly onto the anyon hierarchy Abelian ⊂ Ising ⊂ Fibonacci. The same algebraic ladder that organises instruction sets organises topological order. (ii) The quantum group deformation parameter q is the Forge ISA inverse temperature. Topological quantum computation is quantum mechanics at finite β. (iii) The logical qubit of the toric code is identified with the generator of H¹(T²; Z₂). Quantum error correction is an H¹ obstruction computation, placing the toric code threshold in the Islands/Flatland/The Deep cohomological framework. Results are verified numerically in experiment x445c (Racah coefficient matching for Ising and Fibonacci anyons). This paper is part of the Origami ISA series. Paper 446 (β-Ladder of Exactly Solvable Models, doi:10.5281/zenodo.20761278) extends the same β-axis to the full taxonomy of integrable quantum spin models. Keywords Kitaev model, toric code, topological quantum computation, anyons, Fibonacci anyons, Ising anyons, F-matrix, quantum groups, Racah coefficients, instruction set architecture, topological order, ZX-calculus, cohomology, quantum error correction, beta deformation, Levin-Wen string nets, honeycomb model, modular tensor categories

•Jun 18, 2026•0 citations

Quantum Error Correction as Cohomological Encoding

Ian Richard C Buckley

Quantum error correction (QEC) is cohomological encoding made explicit. We show that the three central codes in fault-tolerant quantum computation correspond precisely to three levels of the H^k tower of the Origami instruction-set architecture (ISA): the Steane [[7,1,3]] code is the Fano plane PG(2,2) at the H^1 tier; the surface code encodes logical qubits as generators of H^1(surface;Z_2); and the 15-to-1 magic state distillation factory is an H^1 Clifford circuit that bridges H^1 and~H^2 by purifying the non-Clifford TWIST\ resource. A fourth result is new: dark-magic errors are syndrome-invisible. A unitary with TWIST>0 that commutes with all stabiliser generators corrupts the logical orbit label while leaving every syndrome bit at +1. Standard randomised benchmarking is insensitive to orbit-label decay; we propose orbit-sensitive randomised benchmarking (ORBIT-RB) as the missing diagnostic. The unified picture is captured in a single sentence: a QEC code of depth k specifies which H^k classes are logical and which are trivial; syndrome measurement computes the coboundary ; error correction finds the minimum-weight representative of the observed H^k class.

•Jul 13, 2026•0 citations

The beta-Ladder of Exactly Solvable Quantum Models: XXZ, TFIM, String Nets, and Quantum Doubles as a Single ISA Family

Ian Richard C Buckley

Shows that XXZ chain, transverse-field Ising model, Levin-Wen string nets, and Kitaev quantum doubles are a single ISA family parameterised by the beta-deformation. At beta=1/2 the BKT transition is a TWIST failure. Walker-Wang models are identified as H2 (BIND-mandatory). Haah codes require twisted coefficients and lie outside the standard H2 tier (fracton sector). The quantum group parameter q = exp(i*pi*beta) encodes the semiring interpolation between tropical (beta=infinity) and metaplectic (beta=0).

•Jul 10, 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•7 citations
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 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.
PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested. We show that Kitaev's topological phases — the toric code, the gapless Dirac cone, and the non-Abelian phase — are three computational phases of the Forge instruction-set architecture (ISA), distinguished by opcode mix and inverse-temperature scheduling via the THERMAL compiler directive. The central result is a pair of exact identities. The F-matrix of Ising anyons equals the j = 1/2 recoupling coefficient of the quantum group SU(2)₂ at q = exp(iπ/4). The F-matrix of Fibonacci anyons equals the j = 1/2 coefficient of SU(2)₃ at q = exp(iπ/5). Both identities are verified numerically. In each case the deformation parameter q = exp(iπ/(k+2)) equals exp(iπβ), where β is the Forge ISA inverse temperature, placing topological quantum computation at finite β in the semiring-deformation interpolating family of the Maslov–Gibbs programme. Three consequences follow: (i) The ISA containment hierarchy ZX ⊂ Origami ISA ⊂ 731-ISA maps exactly onto the anyon hierarchy Abelian ⊂ Ising ⊂ Fibonacci. The same algebraic ladder that organises instruction sets organises topological order. (ii) The quantum group deformation parameter q is the Forge ISA inverse temperature. Topological quantum computation is quantum mechanics at finite β. (iii) The logical qubit of the toric code is identified with the generator of H¹(T²; Z₂). Quantum error correction is an H¹ obstruction computation, placing the toric code threshold in the Islands/Flatland/The Deep cohomological framework. Results are verified numerically in experiment x445c (Racah coefficient matching for Ising and Fibonacci anyons). This paper is part of the Origami ISA series. Paper 446 (β-Ladder of Exactly Solvable Models, doi:10.5281/zenodo.20761278) extends the same β-axis to the full taxonomy of integrable quantum spin models. Keywords Kitaev model, toric code, topological quantum computation, anyons, Fibonacci anyons, Ising anyons, F-matrix, quantum groups, Racah coefficients, instruction set architecture, topological order, ZX-calculus, cohomology, quantum error correction, beta deformation, Levin-Wen string nets, honeycomb model, modular tensor categories
Quantum error correction (QEC) is cohomological encoding made explicit. We show that the three central codes in fault-tolerant quantum computation correspond precisely to three levels of the H^k tower of the Origami instruction-set architecture (ISA): the Steane [[7,1,3]] code is the Fano plane PG(2,2) at the H^1 tier; the surface code encodes logical qubits as generators of H^1(surface;Z_2); and the 15-to-1 magic state distillation factory is an H^1 Clifford circuit that bridges H^1 and~H^2 by purifying the non-Clifford TWIST\ resource. A fourth result is new: dark-magic errors are syndrome-invisible. A unitary with TWIST>0 that commutes with all stabiliser generators corrupts the logical orbit label while leaving every syndrome bit at +1. Standard randomised benchmarking is insensitive to orbit-label decay; we propose orbit-sensitive randomised benchmarking (ORBIT-RB) as the missing diagnostic. The unified picture is captured in a single sentence: a QEC code of depth k specifies which H^k classes are logical and which are trivial; syndrome measurement computes the coboundary ; error correction finds the minimum-weight representative of the observed H^k class.
Shows that XXZ chain, transverse-field Ising model, Levin-Wen string nets, and Kitaev quantum doubles are a single ISA family parameterised by the beta-deformation. At beta=1/2 the BKT transition is a TWIST failure. Walker-Wang models are identified as H2 (BIND-mandatory). Haah codes require twisted coefficients and lie outside the standard H2 tier (fracton sector). The quantum group parameter q = exp(i*pi*beta) encodes the semiring interpolation between tropical (beta=infinity) and metaplectic (beta=0).
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.