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

Homology You Can Run: The Topology of Quantum Codes, from the Logical-Qubit Count to the Phase Transition

The Institute for Applied Ontological Mathematics

Published Oct 11, 2026• 0 citations
Publisher

Abstract

A CSS quantum error-correcting code is, on the nose, a length-three chain complex over F2 : the commutation law HZ H⊤ X = 0 that makes the code valid is exactly the condition ∂ 2 = 0 that makes a chain complex. We take this identification literally and show that the entire working theory of a quantum code is one homological object the same engine computes, at scale, and certifies. The number of logical qubits is the first Betti number, k = dim H1 = n − rank HX − rank HZ = b1 ; the code distance is the systole, the shortest non-contractible cycle. We reproduce the published parameters of state-of-the-art codes exactly—the toric and hypergraph-product families and the IBM bivariate-bicycle codes [[72, 12, 6]], [[144, 12, 12]], [[90, 8, 10]]—cross-validated four independent ways and kernelcertified for the small cases in Cubical Agda, on CPU and GPU. The two scale certificates—the Betti count b1 and the rank-derived logical count k—are themselves kernel-proved to be a single first-homology certificate (a DescentCertificate both readings factor through), closed terminally through a fixed-point engine. We then run the code, not just measure it. (i) The Union-Find decoder is the engine's connected-components reduction, and "a logical error occurred" is the engine's coboundary decision (the residual cycle has nonzero winding); decoding the toric code at growing distance recovers the accuracy threshold near 9.5%, and the optimal (maximum-likelihood) threshold near 11% is the engine's two homology sectors competing as the domain-wall free energy of a random-bond Ising model on the Nishimori line. (ii) A code's distance scaling is its Tanner-graph spectral expansion: the second eigenvalue λ2 versus the Ramanujan bound is a computable certificate (Sipser–Spielman), exact on the topological tier where the spectral gap obeys γ d2 → 4π 2 . (iii) The full chain complex carries metachecks—redundancies among the parity checks—and we compute them: the bivariate-bicycle codes have six, the engines of single-shot error correction; the 4-dimensional toric code's homology (1, 4, 6, 4, 1), with k = b2 = 6, is the tensor of four circle complexes. (iv) The logical error-rate prefactor is the multiplicity of the systole, A = 2L for the toric code, which we compute exactly. (v) Finally the engine measures a topological phase transition: as random noise thickens, torus-wrapping "giant" cycles appear in a sharp homological-percolation transition at pc ≈ 0.5 that sharpens with system size—the same homology machinery now detecting when noise spontaneously writes a logical operator. (vi) The engine runs over any coefficients: qudit (Fp ) codes are chain complexes over Fp , and the integral homology, computed by the Smith normal form, exposes torsion—so a code's logical-qudit count can depend on the qudit dimension, an extra logical appearing exactly when p divides a torsion coefficient (reproducing the known homology of the torus, the Moore spaces, the Klein bottle, and RP2 ). We are careful to fence what is not claimed: minimum distance is NP-hard in general and we compute it only on the systolic tier; the giant-cycle transition is the random-cluster one, distinct from the maximum-likelihood decoding threshold of the random-bond Ising model. The thesis is singular and operational: a quantum code's parameters, its decoder, its quality, its higher-dimensional structure, its performance prefactor, and its phase transition are not six theories but one—homology you can run. Published by The Institute for Applied Ontological Mathematics.

DOI
10.5281/zenodo.23304343

Related papers

Certificates That Touch: Exact Quantum Code Distance from One Witness and One Scan

The Institute for Applied Ontological Mathematics

Computing the distance of a stabilizer code is NP-hard, yet certifying the distance of a given code needs no search at all — only two one-sided certificates that meet. An upper bound is a single explicit logical operator: one vector, checked in milliseconds against the actual check matrix — it commutes with every stabilizer, it is provably outside their span, and it acts on exactly w qubits. A lower bound is a universal statement — no logical operator lives below weight w — discharged by a finite scan whose completeness is itself a theorem, not a convention: a reconstruction lemma proves that every light Pauli vector appears in the scanned list, so the scan quantifies over the whole space rather than over a table someone chose. When the two certificates touch, the distance is exact, and the receipt can be replayed by a referee who trusts neither the authors nor their software. We build this bracket calculus over the binary symplectic carrier, close it exactly on the classical menagerie — the five-qubit perfect code, Steane, Shor, the distance-three rotated surface code, and the 3 × 3 toric code — and report an instructive refutation: our own frozen reference data claimed distance at least 2 for a punctured code fragment, and the certificate layer produced an explicit weight-one logical operator. Puncturing buys a logical qubit and leaves it bare; the count and the distance are independent shadows of the same subgroup lattice. The same prover-proposes/kernel-disposes architecture certifies logical counts at bivariate-bicycle scale (k = 12 at n = 144) from change-of-basis rank certificates checked in linear time, and every number in the system wears a two-valued trust badge whose semantics is an event, not a citation: no kernel run on your instance, no badge. The results are proved in a machine-checked formal kernel. Published by The Institute for Applied Ontological Mathematics.

•Oct 11, 2026•0 citations

Fault-Tolerant Quantum Computation Through Quantum Low-Density Parity-Check Codes

Weilei Zeng

Quantum computation has shown advantages in several problems over the corresponding classical algorithms. The noisy intermediate-size\n quantum devices with dozens of qubits make it more promising in the\n past decade, as the quantum advantage was demonstrated\n experimentally. Before entering the era of scalable quantum\n computation, one has to resolve the errors in a quantum many-body\n system, which is inevitable due to the environment interaction during\n quantum control processes. The goal of quantum error correction is to\n reduce such errors and increase decoherence time. The most successful candidates of quantum error correction codes are topological codes, especially surface codes, which were discovered by\n Alexei Kitaev. The ordered phase of the 2D\n Ising model on a torus ensures that toric codes are fault-tolerant\n below a critical error probability. Other than the FT threshold,\n the topological codes feature efficient encoding and\n decoding, local measurements, but suffer from asymptotically zero\n code rate. To encode more logical qubits with finite resources, one can loosen the condition on locality and extend to a broader class of quantum\n low-density parity-check (LDPC)codes. There are many known algebraic\n constructions for such codes, but only a precious few of them have\n finite code rates and meet the fault-tolerant condition:\n the stabilizer weight is bounded and the distance scales at least\n logarithmically with the code size. In this thesis, I construct the\n higher-dimensional quantum hypergraph product (HQHP) codes, which\n generalize quantum hypergraph product (QHP) codes and toric codes in\n all dimensions. The HQHP codes projected into a single space gives\n subsystem product codes, which can then be gauge fixed to\n concatenated codes or homological product codes. Those include some\n common CSS codes, like Shor’s codes, Bacon Shor’s codes, and\n subsystem QHP codes. The HQHP codes can be mapped to the tensor\n product of chain complexes, which provides an algebraic framework to\n construct quantum LDPC codes with finite code rates, square root\n distances, FT thresholds and single-shot properties with redundant\n checks. Meanwhile, their rich connection to other codes are very\n instructive and may lead to further optimizations. Regarding the\n remained procedures towards fault-tolerant universal quantum\n computation through quantum LDPC codes, I will discuss the\n fault-tolerant condition for each code, including distance,\n stabilizer weight, decoding, fault-tolerant gates and measurement\n protocols.\n

•Jan 1, 2021•0 citations

Homological Thresholds in Randomly Monitored Quantum Error-Correcting Codes

Yoshito Watanabe, Daiki Sasamoto, Bo Han +1 more

Random projective measurements are an effective tool to model the interlinked phenomenology of monitoring, inferring, and decoding highly entangled states such as quantum error-correcting codes. At the same time, the study of such monitored dynamics has opened a new arena for critical phenomena, renewing longstanding questions in disordered statistical mechanics, including percolation, random-bond models, and Nishimori physics. Here we investigate the robustness of stabilizer quantum error-correcting codes under a single round of independently sampled single-qubit Pauli measurements and demonstrate that their threshold behavior falls into two broad categories - geometric and homological percolation transitions, with the toric code and color code being the principal examples for each class. We establish the distinct character of these two threshold theories by analyzing the logical-support criteria of these codes and by providing numerical estimates of their respective critical exponents obtained from optimized stabilizer simulations of large-scale systems with over one million qubits. Our framework extends to non-CSS, subsystem, higher-dimensional, and Floquet stabilizer codes and allows us to determine their respective threshold phase diagrams. We exemplify how the latter provide quantitative and qualitative guidance for the computationally more demanding problems of tunable learning and maximum-likelihood decoding. As a practical application of our framework, we discuss the robustness of the gross code.

quant-pharXiv:2610.02310•Oct 5, 2026•0 citations

The Logical Group Is a Cokernel

The Institute for Applied Ontological Mathematics

A quantum error-correcting code's logical operators, taken modulo its stabilizers, form a finite abelian group; that group, not any single number, is the code's logical identity. We identify the group as one mathematical object across a divide usually treated as fundamental: the cokernel of an integer matrix, read off its Smith normal form. For a Gottesman–Kitaev– Preskill bosonic code the matrix is an integral symplectic Gram matrix and the cokernel is Q 2 (Z/d i Z) ; for a quantum low-density-parity-check digital code the matrix is a boundary i map and the cokernel is its first homology; the reading is the same computation, and code concatenation is the cokernel of a direct sum, so the two Smith normal forms simply concatenate. Because the cokernel is the complete invariant of the two-sided unimodular action, a code's logical group is certified by verifying a witness rather than by trusting a table: a prover supplies (U, D, V ) and a checker re-derives U AV = D in pure integer arithmetic. Every result is checked in Lean 4, and its load-bearing arithmetic is reproved in a second, toolchain-disjoint Cubical Agda kernel from the Peano axioms up. We prove that the group order alone is an incomplete invariant—(Z/2Z)4 and (Z/4Z)2 share order sixteen but differ in two-torsion—give an analog-weighted decoder whose correctable region provably exceeds the hard-decision region because the soft metric widens the distance, and expose the entire certified construction inside a live PennyLane and Strawberry Fields workflow, the software and hardware setting of a photonic fault-tolerant program built on exactly this concatenation. Published by The Institute for Applied Ontological Mathematics.

•Oct 11, 2026•0 citations

Composing 4D Geometric Codes into Higher-Dimensional Logical Structures: A Framework for 24D Quantum Error Correction Stability

James Johnstone Jardine

This work explores the composition of Microsoft's 4D geometric error-correcting codes — built on the 24-cell honeycomb cellulation — into higher-dimensional logical structures targeting 24D stability. While 4D codes have demonstrated 1,000-fold error rate reduction and single-shot correction on neutral atom arrays, this work asks how these codes compose when stacked or tensored into 8D, 12D, or 24D logical architectures. We investigate the stabilizer structure under composition, whether single-shot correctability survives dimensional lifting, and the mapping of composed code geometries onto neutral atom hardware with all-to-all connectivity. This bridges the gap between demonstrated 4D fault-tolerant codes and the theoretical framework for topological codes beyond dimension 2. Update, 30 July 2026 — constructive resolution. The distance question raised here is now settled by direct construction in 10.5281/zenodo.21698294, which builds the 4D toric code from its cubical chain complex and obtains [[96,6,4]] at L=2: k=6 exactly by GF(2) rank, and distance 4 proven exhaustively over every error pattern of weight ≤4. Distance 8 is therefore not obtainable from the 4D toric construction. That bounds the 4D toric family only and does not establish that no [[96,6,8]] code exists in another family — the quantum Singleton bound permits it comfortably at these parameters. An earlier wording of this note, added and corrected on 30 July 2026, overstated the scope. That work was carried out independently, from first principles, and reaches the same conclusion. Erratum, 2026-07-31 — the novelty claim is withdrawn, and what replaces it. The deposited file states that "nobody has published on composing 4D geometric codes into higher-dimensional logical structures" and that the bridge paper "has not been written." That is false. Composing chain-complex CSS codes is the homological (tensor) product of chain complexes, and the cellular chain complex of a product complex is the tensor product of the factors', so the composition of two 4D cubic toric codes is the 8D cubic toric code — a published family, and the subject of this record's own reference #9. This was checked, not assumed: an explicitly composed 8D code and an independently built 8D cubic toric code agree at all 8 grades on shape, nonzero count, both check-weight spectra and exact GF(2) rank. The composition constructs no new code. What replaces the claim is a quantitative answer to the question the record was actually reaching for. For the balanced hypercubic toric code at middle grade, n/k = L^D exactly and independently of D — verified in 8 of 8 computed cases, with the qubit count a combinatorial count and the logical count a measured pair of GF(2) ranks, up to n = 459,270 where both ranks were measured directly. Composing therefore changes how many logical qubits sit in one block and changes nothing else. Head to head at the same distance 81, the 8D composite [[459270, 70, d ≤ 81]] and the plain 4D code [[39366, 6, d ≤ 81]] both spend 6,561 physical qubits per logical qubit, to the digit — with the 8D version paying weight-10 stabilizers where the 4D pays weight-6. Distance does not rescue it either: by Künneth the distance of a product is bounded by the minimum over grade splittings, not the product of the factors' distances, so each added dimension is a chance to lose distance — the 5D product of [[486,6,9]] at grade 1 is [[1215, 5, 3]], proved exactly. On single-shot correction: there is nothing to lift. D = 4 at q = 2 already has metachecks in both sectors (ranks 80 and 80 for [[486,6,9]]), so 8D, 12D and 24D add no sector that was not already covered — and lifting can lose it, the 5D product at grade 1 having no X-sector metachecks at all (rank d₀ = 0). On hardware: all-to-all connectivity is real but was never the binding constraint. The smallest possible balanced 24D hypercubic toric code needs 4.5 × 10¹³ physical qubits, 1.5 × 10¹⁰ times the 3,000-atom array cited above. What stands: the homological product is the correct composition operation and the framework is well-posed; composition genuinely does raise dimension and does buy more logical qubits per block (6 → 70 from 4D to 8D); the metacheck question was the right one to ask; and the reference library is accurate. Two limits on the erratum itself: all computation uses the cubic 4-torus code [[486,6,9]], not Microsoft's 24-cell honeycomb code, whose parity-check matrices were never obtained — so nothing here is a statement about that code; and no exact distance is claimed at n ≥ 2430, the 8D figures being certified upper bounds with no lower bound proved. The 1,000-fold error-rate reduction and the neutral-atom hardware results were not tested and are neither confirmed nor refuted. Full computation, code and logs: 10.5281/zenodo.20808710 and branch writeup at /home/voodoo/branch_work/18779369_composition/RESULT.md. Note: the source file QEC_Neutral_Atom_24D_Research.md itself still contains the withdrawn claim verbatim (a published file cannot be edited in place) — this erratum is the authoritative correction until a new version replaces the file text.

•Feb 26, 2026•1 citation

Certified decoding of quantum LDPC codes

Ragavi Krishnamoorthy, Florian Gerhardt, Johannes Knaute +8 more

Quantum low-density parity-check (qLDPC) codes reduce the qubit overhead of fault-tolerant quantum computation by an order of magnitude, but their decoding is harder than its classical counterpart: because many physical errors are equivalent up to stabilizers, the degenerate maximum-likelihood (ML) decoder must compare the probabilities of entire equivalence classes of errors, that is, partition functions, rather than single errors. The workhorse decoder BP+OSD sidesteps degeneracy heuristically and offers no guarantees. We treat degenerate decoding as probabilistic inference in an undirected graphical model: the probability of each logical class is the partition function of an unconstrained, strictly positive Markov random field over the code's check variables, a construction that generalizes the random-bond Ising mapping of the surface code to arbitrary CSS codes and to spacetime decoding with measurement errors and circuit-level noise. On this model we build two decoders. The first estimates all class partition functions by annealed importance sampling with common random numbers and attaches to every decision a certificate of optimality: a paired bootstrap test, or, composed with constant-factor estimators such as WISH, an exact optimality proof. The second is region-based: the Bethe free energy, whose bias cancels between classes, reproduces exact ML decoding on every tested surface-code instance at millisecond cost, and enlarging the regions to elimination clusters makes exact degenerate ML decoding of the [[72,12,6]] bivariate bicycle code feasible. Across surface codes and the bivariate bicycle codes [[72,12,6]] and [[144,12,12]], under code-capacity, phenomenological, and circuit-level noise, the sampling decoder matches or exceeds BP+OSD while certifying the bulk of its decisions, and the certificate flags exactly the syndromes on which any fast decoder should be distrusted.

quant-pharXiv:2608.25545•Aug 27, 2026•2 citations
A CSS quantum error-correcting code is, on the nose, a length-three chain complex over F2 : the commutation law HZ H⊤ X = 0 that makes the code valid is exactly the condition ∂ 2 = 0 that makes a chain complex. We take this identification literally and show that the entire working theory of a quantum code is one homological object the same engine computes, at scale, and certifies. The number of logical qubits is the first Betti number, k = dim H1 = n − rank HX − rank HZ = b1 ; the code distance is the systole, the shortest non-contractible cycle. We reproduce the published parameters of state-of-the-art codes exactly—the toric and hypergraph-product families and the IBM bivariate-bicycle codes [[72, 12, 6]], [[144, 12, 12]], [[90, 8, 10]]—cross-validated four independent ways and kernelcertified for the small cases in Cubical Agda, on CPU and GPU. The two scale certificates—the Betti count b1 and the rank-derived logical count k—are themselves kernel-proved to be a single first-homology certificate (a DescentCertificate both readings factor through), closed terminally through a fixed-point engine. We then run the code, not just measure it. (i) The Union-Find decoder is the engine's connected-components reduction, and "a logical error occurred" is the engine's coboundary decision (the residual cycle has nonzero winding); decoding the toric code at growing distance recovers the accuracy threshold near 9.5%, and the optimal (maximum-likelihood) threshold near 11% is the engine's two homology sectors competing as the domain-wall free energy of a random-bond Ising model on the Nishimori line. (ii) A code's distance scaling is its Tanner-graph spectral expansion: the second eigenvalue λ2 versus the Ramanujan bound is a computable certificate (Sipser–Spielman), exact on the topological tier where the spectral gap obeys γ d2 → 4π 2 . (iii) The full chain complex carries metachecks—redundancies among the parity checks—and we compute them: the bivariate-bicycle codes have six, the engines of single-shot error correction; the 4-dimensional toric code's homology (1, 4, 6, 4, 1), with k = b2 = 6, is the tensor of four circle complexes. (iv) The logical error-rate prefactor is the multiplicity of the systole, A = 2L for the toric code, which we compute exactly. (v) Finally the engine measures a topological phase transition: as random noise thickens, torus-wrapping "giant" cycles appear in a sharp homological-percolation transition at pc ≈ 0.5 that sharpens with system size—the same homology machinery now detecting when noise spontaneously writes a logical operator. (vi) The engine runs over any coefficients: qudit (Fp ) codes are chain complexes over Fp , and the integral homology, computed by the Smith normal form, exposes torsion—so a code's logical-qudit count can depend on the qudit dimension, an extra logical appearing exactly when p divides a torsion coefficient (reproducing the known homology of the torus, the Moore spaces, the Klein bottle, and RP2 ). We are careful to fence what is not claimed: minimum distance is NP-hard in general and we compute it only on the systolic tier; the giant-cycle transition is the random-cluster one, distinct from the maximum-likelihood decoding threshold of the random-bond Ising model. The thesis is singular and operational: a quantum code's parameters, its decoder, its quality, its higher-dimensional structure, its performance prefactor, and its phase transition are not six theories but one—homology you can run. Published by The Institute for Applied Ontological Mathematics.
Computing the distance of a stabilizer code is NP-hard, yet certifying the distance of a given code needs no search at all — only two one-sided certificates that meet. An upper bound is a single explicit logical operator: one vector, checked in milliseconds against the actual check matrix — it commutes with every stabilizer, it is provably outside their span, and it acts on exactly w qubits. A lower bound is a universal statement — no logical operator lives below weight w — discharged by a finite scan whose completeness is itself a theorem, not a convention: a reconstruction lemma proves that every light Pauli vector appears in the scanned list, so the scan quantifies over the whole space rather than over a table someone chose. When the two certificates touch, the distance is exact, and the receipt can be replayed by a referee who trusts neither the authors nor their software. We build this bracket calculus over the binary symplectic carrier, close it exactly on the classical menagerie — the five-qubit perfect code, Steane, Shor, the distance-three rotated surface code, and the 3 × 3 toric code — and report an instructive refutation: our own frozen reference data claimed distance at least 2 for a punctured code fragment, and the certificate layer produced an explicit weight-one logical operator. Puncturing buys a logical qubit and leaves it bare; the count and the distance are independent shadows of the same subgroup lattice. The same prover-proposes/kernel-disposes architecture certifies logical counts at bivariate-bicycle scale (k = 12 at n = 144) from change-of-basis rank certificates checked in linear time, and every number in the system wears a two-valued trust badge whose semantics is an event, not a citation: no kernel run on your instance, no badge. The results are proved in a machine-checked formal kernel. Published by The Institute for Applied Ontological Mathematics.
Quantum computation has shown advantages in several problems over the corresponding classical algorithms. The noisy intermediate-size\n quantum devices with dozens of qubits make it more promising in the\n past decade, as the quantum advantage was demonstrated\n experimentally. Before entering the era of scalable quantum\n computation, one has to resolve the errors in a quantum many-body\n system, which is inevitable due to the environment interaction during\n quantum control processes. The goal of quantum error correction is to\n reduce such errors and increase decoherence time. The most successful candidates of quantum error correction codes are topological codes, especially surface codes, which were discovered by\n Alexei Kitaev. The ordered phase of the 2D\n Ising model on a torus ensures that toric codes are fault-tolerant\n below a critical error probability. Other than the FT threshold,\n the topological codes feature efficient encoding and\n decoding, local measurements, but suffer from asymptotically zero\n code rate. To encode more logical qubits with finite resources, one can loosen the condition on locality and extend to a broader class of quantum\n low-density parity-check (LDPC)codes. There are many known algebraic\n constructions for such codes, but only a precious few of them have\n finite code rates and meet the fault-tolerant condition:\n the stabilizer weight is bounded and the distance scales at least\n logarithmically with the code size. In this thesis, I construct the\n higher-dimensional quantum hypergraph product (HQHP) codes, which\n generalize quantum hypergraph product (QHP) codes and toric codes in\n all dimensions. The HQHP codes projected into a single space gives\n subsystem product codes, which can then be gauge fixed to\n concatenated codes or homological product codes. Those include some\n common CSS codes, like Shor’s codes, Bacon Shor’s codes, and\n subsystem QHP codes. The HQHP codes can be mapped to the tensor\n product of chain complexes, which provides an algebraic framework to\n construct quantum LDPC codes with finite code rates, square root\n distances, FT thresholds and single-shot properties with redundant\n checks. Meanwhile, their rich connection to other codes are very\n instructive and may lead to further optimizations. Regarding the\n remained procedures towards fault-tolerant universal quantum\n computation through quantum LDPC codes, I will discuss the\n fault-tolerant condition for each code, including distance,\n stabilizer weight, decoding, fault-tolerant gates and measurement\n protocols.\n
Random projective measurements are an effective tool to model the interlinked phenomenology of monitoring, inferring, and decoding highly entangled states such as quantum error-correcting codes. At the same time, the study of such monitored dynamics has opened a new arena for critical phenomena, renewing longstanding questions in disordered statistical mechanics, including percolation, random-bond models, and Nishimori physics. Here we investigate the robustness of stabilizer quantum error-correcting codes under a single round of independently sampled single-qubit Pauli measurements and demonstrate that their threshold behavior falls into two broad categories - geometric and homological percolation transitions, with the toric code and color code being the principal examples for each class. We establish the distinct character of these two threshold theories by analyzing the logical-support criteria of these codes and by providing numerical estimates of their respective critical exponents obtained from optimized stabilizer simulations of large-scale systems with over one million qubits. Our framework extends to non-CSS, subsystem, higher-dimensional, and Floquet stabilizer codes and allows us to determine their respective threshold phase diagrams. We exemplify how the latter provide quantitative and qualitative guidance for the computationally more demanding problems of tunable learning and maximum-likelihood decoding. As a practical application of our framework, we discuss the robustness of the gross code.
A quantum error-correcting code's logical operators, taken modulo its stabilizers, form a finite abelian group; that group, not any single number, is the code's logical identity. We identify the group as one mathematical object across a divide usually treated as fundamental: the cokernel of an integer matrix, read off its Smith normal form. For a Gottesman–Kitaev– Preskill bosonic code the matrix is an integral symplectic Gram matrix and the cokernel is Q 2 (Z/d i Z) ; for a quantum low-density-parity-check digital code the matrix is a boundary i map and the cokernel is its first homology; the reading is the same computation, and code concatenation is the cokernel of a direct sum, so the two Smith normal forms simply concatenate. Because the cokernel is the complete invariant of the two-sided unimodular action, a code's logical group is certified by verifying a witness rather than by trusting a table: a prover supplies (U, D, V ) and a checker re-derives U AV = D in pure integer arithmetic. Every result is checked in Lean 4, and its load-bearing arithmetic is reproved in a second, toolchain-disjoint Cubical Agda kernel from the Peano axioms up. We prove that the group order alone is an incomplete invariant—(Z/2Z)4 and (Z/4Z)2 share order sixteen but differ in two-torsion—give an analog-weighted decoder whose correctable region provably exceeds the hard-decision region because the soft metric widens the distance, and expose the entire certified construction inside a live PennyLane and Strawberry Fields workflow, the software and hardware setting of a photonic fault-tolerant program built on exactly this concatenation. Published by The Institute for Applied Ontological Mathematics.
This work explores the composition of Microsoft's 4D geometric error-correcting codes — built on the 24-cell honeycomb cellulation — into higher-dimensional logical structures targeting 24D stability. While 4D codes have demonstrated 1,000-fold error rate reduction and single-shot correction on neutral atom arrays, this work asks how these codes compose when stacked or tensored into 8D, 12D, or 24D logical architectures. We investigate the stabilizer structure under composition, whether single-shot correctability survives dimensional lifting, and the mapping of composed code geometries onto neutral atom hardware with all-to-all connectivity. This bridges the gap between demonstrated 4D fault-tolerant codes and the theoretical framework for topological codes beyond dimension 2. Update, 30 July 2026 — constructive resolution. The distance question raised here is now settled by direct construction in 10.5281/zenodo.21698294, which builds the 4D toric code from its cubical chain complex and obtains [[96,6,4]] at L=2: k=6 exactly by GF(2) rank, and distance 4 proven exhaustively over every error pattern of weight ≤4. Distance 8 is therefore not obtainable from the 4D toric construction. That bounds the 4D toric family only and does not establish that no [[96,6,8]] code exists in another family — the quantum Singleton bound permits it comfortably at these parameters. An earlier wording of this note, added and corrected on 30 July 2026, overstated the scope. That work was carried out independently, from first principles, and reaches the same conclusion. Erratum, 2026-07-31 — the novelty claim is withdrawn, and what replaces it. The deposited file states that "nobody has published on composing 4D geometric codes into higher-dimensional logical structures" and that the bridge paper "has not been written." That is false. Composing chain-complex CSS codes is the homological (tensor) product of chain complexes, and the cellular chain complex of a product complex is the tensor product of the factors', so the composition of two 4D cubic toric codes is the 8D cubic toric code — a published family, and the subject of this record's own reference #9. This was checked, not assumed: an explicitly composed 8D code and an independently built 8D cubic toric code agree at all 8 grades on shape, nonzero count, both check-weight spectra and exact GF(2) rank. The composition constructs no new code. What replaces the claim is a quantitative answer to the question the record was actually reaching for. For the balanced hypercubic toric code at middle grade, n/k = L^D exactly and independently of D — verified in 8 of 8 computed cases, with the qubit count a combinatorial count and the logical count a measured pair of GF(2) ranks, up to n = 459,270 where both ranks were measured directly. Composing therefore changes how many logical qubits sit in one block and changes nothing else. Head to head at the same distance 81, the 8D composite [[459270, 70, d ≤ 81]] and the plain 4D code [[39366, 6, d ≤ 81]] both spend 6,561 physical qubits per logical qubit, to the digit — with the 8D version paying weight-10 stabilizers where the 4D pays weight-6. Distance does not rescue it either: by Künneth the distance of a product is bounded by the minimum over grade splittings, not the product of the factors' distances, so each added dimension is a chance to lose distance — the 5D product of [[486,6,9]] at grade 1 is [[1215, 5, 3]], proved exactly. On single-shot correction: there is nothing to lift. D = 4 at q = 2 already has metachecks in both sectors (ranks 80 and 80 for [[486,6,9]]), so 8D, 12D and 24D add no sector that was not already covered — and lifting can lose it, the 5D product at grade 1 having no X-sector metachecks at all (rank d₀ = 0). On hardware: all-to-all connectivity is real but was never the binding constraint. The smallest possible balanced 24D hypercubic toric code needs 4.5 × 10¹³ physical qubits, 1.5 × 10¹⁰ times the 3,000-atom array cited above. What stands: the homological product is the correct composition operation and the framework is well-posed; composition genuinely does raise dimension and does buy more logical qubits per block (6 → 70 from 4D to 8D); the metacheck question was the right one to ask; and the reference library is accurate. Two limits on the erratum itself: all computation uses the cubic 4-torus code [[486,6,9]], not Microsoft's 24-cell honeycomb code, whose parity-check matrices were never obtained — so nothing here is a statement about that code; and no exact distance is claimed at n ≥ 2430, the 8D figures being certified upper bounds with no lower bound proved. The 1,000-fold error-rate reduction and the neutral-atom hardware results were not tested and are neither confirmed nor refuted. Full computation, code and logs: 10.5281/zenodo.20808710 and branch writeup at /home/voodoo/branch_work/18779369_composition/RESULT.md. Note: the source file QEC_Neutral_Atom_24D_Research.md itself still contains the withdrawn claim verbatim (a published file cannot be edited in place) — this erratum is the authoritative correction until a new version replaces the file text.
Quantum low-density parity-check (qLDPC) codes reduce the qubit overhead of fault-tolerant quantum computation by an order of magnitude, but their decoding is harder than its classical counterpart: because many physical errors are equivalent up to stabilizers, the degenerate maximum-likelihood (ML) decoder must compare the probabilities of entire equivalence classes of errors, that is, partition functions, rather than single errors. The workhorse decoder BP+OSD sidesteps degeneracy heuristically and offers no guarantees. We treat degenerate decoding as probabilistic inference in an undirected graphical model: the probability of each logical class is the partition function of an unconstrained, strictly positive Markov random field over the code's check variables, a construction that generalizes the random-bond Ising mapping of the surface code to arbitrary CSS codes and to spacetime decoding with measurement errors and circuit-level noise. On this model we build two decoders. The first estimates all class partition functions by annealed importance sampling with common random numbers and attaches to every decision a certificate of optimality: a paired bootstrap test, or, composed with constant-factor estimators such as WISH, an exact optimality proof. The second is region-based: the Bethe free energy, whose bias cancels between classes, reproduces exact ML decoding on every tested surface-code instance at millisecond cost, and enlarging the regions to elimination clusters makes exact degenerate ML decoding of the [[72,12,6]] bivariate bicycle code feasible. Across surface codes and the bivariate bicycle codes [[72,12,6]] and [[144,12,12]], under code-capacity, phenomenological, and circuit-level noise, the sampling decoder matches or exceeds BP+OSD while certifying the bulk of its decisions, and the certificate flags exactly the syndromes on which any fast decoder should be distrusted.