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

Topological Decoder Advantage: Graph-Family Generalization and Error-Boundary Predictions for Contextual Information Residue

Apoth3osis Labs, goodman Richard, Veselov Vladimir

Published Apr 21, 2026• 0 citations
Publisher

Abstract

We extend the Shannon-blind contextual information residue separation theorem fromcycle graphs to arbitrary finite graph families and introduce a partition-function formalismfor predicting error-regime boundaries. Our contributions are threefold. (1) We generalize theČech cohomological obstruction to parameterized n-cycles (proved for all n ≥ 3), completegraphs (K4 , with dim H 1 = 3), and trees (negative control: dim H 1 = 0, separation collapses).The polynomial degree barrier persists across all tested cycle lengths n ∈ {3, 4, 5, 7, 10, 15, 20}.P(2) We define a finite Čech Hamiltonian and partition function Z(β) = ω exp(−β · H(ω))on the measurement-cover graph, whose heat-capacity peak identifies a critical inversetemperature β ∗ predicting the error regime. (3) We present a falsifiability surface: the regimeclassifier (exact-decoder-required vs. surrogate-sufficient) is correct for all 8 tested graphfamilies, while the quantitative threshold predictions are falsified for 5 of 8 families undertolerance 0.03. All proofs are verified in Lean 4 with zero sorry declarations; all experimentsare exhaustive finite-graph enumerations reproducible from a single command. The separationis binary: any non-trivial cycle topology (H 1 ≥ 1) activates the full polynomial barrier,making exact symbolic computation the only reliable decoder for topologically structuredworkloads.

DOI
10.5281/zenodo.19686128

Related papers

Contextual Information Residue Is Shannon-Blind A Formally Verified Three-Layer Separation Theorem in Finite Čech Cohomology

The Institute for Applied Ontological Mathematics

We establish a formally verified three-layer separation theorem demonstrating that contextual information residue—the non-trivial Čech cohomology class of a Boolean 1cochain on a finite Z/2 cycle graph—is structurally invisible to both Shannon mutual information and bounded-degree polynomial computation. Specifically: (1) Shannon mutual information of a binary symmetric channel achieves AUC = 0.500 for contextual/noncontextual classification, exhibiting perfect orthogonality; (2) multilinear polynomials of degree d < n on n-bit cochains produce FN = 4088/4092 on the exhaustive corpus, a consequence of the Minsky–Papert degree barrier; and (3) exact rational symbolic evaluation Q via the parity formula parity(b) = (1 − i (1 − 2bi ))/2 ∈ Q achieves perfect classification with zero error. The algebraic core—including H 1 (Cn ; Z/2) ∼ = Z/2 and the non-coboundary witness for the triangle and square parity cochains—is verified in Lean 4 with Mathlib. The corpus comprises all 2n Boolean 1-cochains on cycles Cn for n ∈ {3, . . . , 12}, totaling 8,184 cochains exhaustively enumerated. All proofs, experiments, and data are publicly available. Published by The Institute for Applied Ontological Mathematics.

•Oct 11, 2026•0 citations

The Cohomology of Copying

The Institute for Applied Ontological Mathematics

Whether a quantum proof outperforms a classical one — both checked by the same efficient quantum verifier — is a question answered, so far, only relative to oracles. Beneath that answer is a structure with no quantum content at all: the difference between a resource one can copy and one one cannot. We show that this difference is cohomological. A witness that carries a copy map collapses every verifier to a memoryless sampler, so its distinguishing power is a functional of k-wise marginals alone; the obstruction to copying is a Čech class on a cover of a state by its measurement bases, and the Forrelation function of Aaronson and Ambainis is exactly the transition cocycle of that cover. The separation holds precisely when the class is nonzero: invisible from inside any single copyable chart, where it is a coboundary, and visible to the linear witness that reads the whole cover at once. Four familiar facts turn out to be four faces of the same class. Its non-vanishing is the no-cloning theorem; the dimension of its kernel is the Landauer erasure cost of the witness register; its representative on the standard/Hadamard cover is Forrelation; and the collapse of the copyable verifier onto one chart is why a classical witness, for these problems, cannot win. We make each face a finite, exactly computed certificate: on a corpus of distinguishing tasks built from Heisenberg–Weyl orbits, every depth-two adaptive sampler has advantage exactly zero — a total quantification over the strategy space, not a sampled estimate — while the linear witness reads a squared-Forrelation gap the kernel computes from truth tables through the Hadamard transform. Two independent exact computations agree on every verdict, and the engine that results either returns a gap two exact paths both certify, or refuses — and a refusal carries its own evidence, a certificate of exactly the obstruction that stopped it. The asymptotic separation of the underlying family is not ours; we cite it. What is ours is the identification — that a separation of complexity classes is, at bottom, a hole. All results below are machine-checked in Lean 4; the formal record and its axiom footprint are described in Section 8. The paper is legible in mathematics alone. Published by The Institute for Applied Ontological Mathematics.

•Oct 11, 2026•0 citations

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

The Institute for Applied Ontological Mathematics

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.

•Oct 11, 2026•0 citations

Theory and Practice of Non-Binary Graph-Based Codes: A Combinatorial View

Behzad Amiri

We are undergoing a revolution in data. The ever-growing amount of information in our world has created an unprecedented demand for ultra-reliable, affordable, and resource-efficient data storage systems. Error-correcting codes, as a critical component of any memory device, will play a crucial role in the future of data storage.One particular class of error-correcting codes, known as graph-based codes, has drawn significant attention in both academia and in industry. Graph-based codes offer superior performance compared to traditional algebraic codes. Recently, it has been shown that non-binary graph-based codes, which operate over finite fields rather than binary alphabets, outperform their binary counterparts and exhibit outstanding overall performance. For this reason, these codes are particularly suitable for emerging data storage systems.In this dissertation, we present a comprehensive combinatorial analysis of non-binary graph-based codes. We perform both finite-length and asymptotic analyses for these codes, providing a systematic framework to evaluate and optimize various families of non-binary graph-based codes.In the finite-length case, we provide a mathematical characterization of the error floor problem, including a general definition of absorbing sets over non-binary alphabets. We consider several structured low-density parity-check (LDPC) codes, including quasi-cyclic and spatially-coupled codes, as well as unstructured LDPC codes. We offer design guidelines for non-binary LDPC codes with outstanding performance in extremely low error-rate regimes; making them excellent candidates for data storage applications.In the asymptotic case, we provide a novel toolbox for the evaluation of families of non-binary graph-based codes. By utilizing insights from graph theory and combinatorics, we establish enumerators for a general family of graph-based codes which are constructed based on protographs. We provide asymptotic distributions of codewords and trapping sets for the family of protograph-based codes. Furthermore, we present an asymptotic enumeration of binary and non-binary elementary absorbing sets for regular code ensembles.The contributions of this dissertation can potentially impact a broad range of data storage and communication technologies that require excellent performance in high-reliability regimes.

•Jan 1, 2015•0 citations

Relational Anchors for Quantum Subsystem Identification: Minimal Separation and Robust Rigidity

Oliver Tuma

Operational data can be complete inside a chosen subsystem frame while leaving the frame itself non-unique. A previous finite certification construction exhibits this phenomenon explicitly: an unpartitioned three-qubit Pauli presentation supports three inequivalent finest full tensor frames even though its generated observable algebra is all of M_8(\mathbb C). We ask what additional information can select one frame without treating that information as merely another unlabelled control direction. We introduce relational anchors: gauge-equivariant constraints on a finite refinement poset of direction-generated frames. A general finite-poset theorem characterizes exact anchor collapse and turns target certification into a hitting-set problem, while global frame identification becomes a test-cover problem. In the three-qubit presentation we enumerate the complete nontrivial full witness poset, prove that one two-direction locality anchor separates all three finest frames, and determine exactly twelve single anchors of this type that pass the full-poset test. For robustness, exact support is replaced by conditional-expectation signatures, yielding a sharp \gamma/2 separation criterion. We prove a zero-radius result for the exact witness poset under unrestricted raw perturbations and derive a sharp projective Pauli decoding radius. Six Hamiltonian-derivation squares reconstruct the projective Pauli geometry. A residual synchronization analysis separates ordinary graph cycles from gauge-invariant parity constraints, and four atomic Jordan–Lie anchors are necessary and sufficient, within the declared anchor class, to reduce the remaining scale and sign freedom to Clifford gauge. An explicit relative-defect rigidity modulus and a protocol-conditioned end-to-end error certificate are obtained. The result does not claim that probabilities alone determine a physical tensor-product structure. Rather, unpartitioned process data together with a finite relational anchor package robustly identify a subsystem frame up to the declared gauge.

•Aug 28, 2026•0 citations

Error correcting power of small topological codes

Naomi Nickerson

Many quantum technologies are now reaching a high level of maturity and control, and it is likely that the first demonstrations of suppression of naturally occurring quantum noise using small topological error correcting codes will soon be possible. In doing this it will be necessary to define clear achievable metrics to measure and compare the performance of real codes. Here we consider the smallest examples of several families of topological codes: surface codes, color codes, and the gauge color code, and determine the minimum requirements to demonstrate error suppression. We use an exact decoder to compare the performance of the codes under simple models of both physical error and measurement error, and determine regions of correctability in the physical parameters for each code.

arXiv:1609.01753•Sep 6, 2016•7 citations
We extend the Shannon-blind contextual information residue separation theorem fromcycle graphs to arbitrary finite graph families and introduce a partition-function formalismfor predicting error-regime boundaries. Our contributions are threefold. (1) We generalize theČech cohomological obstruction to parameterized n-cycles (proved for all n ≥ 3), completegraphs (K4 , with dim H 1 = 3), and trees (negative control: dim H 1 = 0, separation collapses).The polynomial degree barrier persists across all tested cycle lengths n ∈ {3, 4, 5, 7, 10, 15, 20}.P(2) We define a finite Čech Hamiltonian and partition function Z(β) = ω exp(−β · H(ω))on the measurement-cover graph, whose heat-capacity peak identifies a critical inversetemperature β ∗ predicting the error regime. (3) We present a falsifiability surface: the regimeclassifier (exact-decoder-required vs. surrogate-sufficient) is correct for all 8 tested graphfamilies, while the quantitative threshold predictions are falsified for 5 of 8 families undertolerance 0.03. All proofs are verified in Lean 4 with zero sorry declarations; all experimentsare exhaustive finite-graph enumerations reproducible from a single command. The separationis binary: any non-trivial cycle topology (H 1 ≥ 1) activates the full polynomial barrier,making exact symbolic computation the only reliable decoder for topologically structuredworkloads.
We establish a formally verified three-layer separation theorem demonstrating that contextual information residue—the non-trivial Čech cohomology class of a Boolean 1cochain on a finite Z/2 cycle graph—is structurally invisible to both Shannon mutual information and bounded-degree polynomial computation. Specifically: (1) Shannon mutual information of a binary symmetric channel achieves AUC = 0.500 for contextual/noncontextual classification, exhibiting perfect orthogonality; (2) multilinear polynomials of degree d < n on n-bit cochains produce FN = 4088/4092 on the exhaustive corpus, a consequence of the Minsky–Papert degree barrier; and (3) exact rational symbolic evaluation Q via the parity formula parity(b) = (1 − i (1 − 2bi ))/2 ∈ Q achieves perfect classification with zero error. The algebraic core—including H 1 (Cn ; Z/2) ∼ = Z/2 and the non-coboundary witness for the triangle and square parity cochains—is verified in Lean 4 with Mathlib. The corpus comprises all 2n Boolean 1-cochains on cycles Cn for n ∈ {3, . . . , 12}, totaling 8,184 cochains exhaustively enumerated. All proofs, experiments, and data are publicly available. Published by The Institute for Applied Ontological Mathematics.
Whether a quantum proof outperforms a classical one — both checked by the same efficient quantum verifier — is a question answered, so far, only relative to oracles. Beneath that answer is a structure with no quantum content at all: the difference between a resource one can copy and one one cannot. We show that this difference is cohomological. A witness that carries a copy map collapses every verifier to a memoryless sampler, so its distinguishing power is a functional of k-wise marginals alone; the obstruction to copying is a Čech class on a cover of a state by its measurement bases, and the Forrelation function of Aaronson and Ambainis is exactly the transition cocycle of that cover. The separation holds precisely when the class is nonzero: invisible from inside any single copyable chart, where it is a coboundary, and visible to the linear witness that reads the whole cover at once. Four familiar facts turn out to be four faces of the same class. Its non-vanishing is the no-cloning theorem; the dimension of its kernel is the Landauer erasure cost of the witness register; its representative on the standard/Hadamard cover is Forrelation; and the collapse of the copyable verifier onto one chart is why a classical witness, for these problems, cannot win. We make each face a finite, exactly computed certificate: on a corpus of distinguishing tasks built from Heisenberg–Weyl orbits, every depth-two adaptive sampler has advantage exactly zero — a total quantification over the strategy space, not a sampled estimate — while the linear witness reads a squared-Forrelation gap the kernel computes from truth tables through the Hadamard transform. Two independent exact computations agree on every verdict, and the engine that results either returns a gap two exact paths both certify, or refuses — and a refusal carries its own evidence, a certificate of exactly the obstruction that stopped it. The asymptotic separation of the underlying family is not ours; we cite it. What is ours is the identification — that a separation of complexity classes is, at bottom, a hole. All results below are machine-checked in Lean 4; the formal record and its axiom footprint are described in Section 8. The paper is legible in mathematics alone. Published by The Institute for Applied Ontological Mathematics.
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.
We are undergoing a revolution in data. The ever-growing amount of information in our world has created an unprecedented demand for ultra-reliable, affordable, and resource-efficient data storage systems. Error-correcting codes, as a critical component of any memory device, will play a crucial role in the future of data storage.One particular class of error-correcting codes, known as graph-based codes, has drawn significant attention in both academia and in industry. Graph-based codes offer superior performance compared to traditional algebraic codes. Recently, it has been shown that non-binary graph-based codes, which operate over finite fields rather than binary alphabets, outperform their binary counterparts and exhibit outstanding overall performance. For this reason, these codes are particularly suitable for emerging data storage systems.In this dissertation, we present a comprehensive combinatorial analysis of non-binary graph-based codes. We perform both finite-length and asymptotic analyses for these codes, providing a systematic framework to evaluate and optimize various families of non-binary graph-based codes.In the finite-length case, we provide a mathematical characterization of the error floor problem, including a general definition of absorbing sets over non-binary alphabets. We consider several structured low-density parity-check (LDPC) codes, including quasi-cyclic and spatially-coupled codes, as well as unstructured LDPC codes. We offer design guidelines for non-binary LDPC codes with outstanding performance in extremely low error-rate regimes; making them excellent candidates for data storage applications.In the asymptotic case, we provide a novel toolbox for the evaluation of families of non-binary graph-based codes. By utilizing insights from graph theory and combinatorics, we establish enumerators for a general family of graph-based codes which are constructed based on protographs. We provide asymptotic distributions of codewords and trapping sets for the family of protograph-based codes. Furthermore, we present an asymptotic enumeration of binary and non-binary elementary absorbing sets for regular code ensembles.The contributions of this dissertation can potentially impact a broad range of data storage and communication technologies that require excellent performance in high-reliability regimes.
Operational data can be complete inside a chosen subsystem frame while leaving the frame itself non-unique. A previous finite certification construction exhibits this phenomenon explicitly: an unpartitioned three-qubit Pauli presentation supports three inequivalent finest full tensor frames even though its generated observable algebra is all of M_8(\mathbb C). We ask what additional information can select one frame without treating that information as merely another unlabelled control direction. We introduce relational anchors: gauge-equivariant constraints on a finite refinement poset of direction-generated frames. A general finite-poset theorem characterizes exact anchor collapse and turns target certification into a hitting-set problem, while global frame identification becomes a test-cover problem. In the three-qubit presentation we enumerate the complete nontrivial full witness poset, prove that one two-direction locality anchor separates all three finest frames, and determine exactly twelve single anchors of this type that pass the full-poset test. For robustness, exact support is replaced by conditional-expectation signatures, yielding a sharp \gamma/2 separation criterion. We prove a zero-radius result for the exact witness poset under unrestricted raw perturbations and derive a sharp projective Pauli decoding radius. Six Hamiltonian-derivation squares reconstruct the projective Pauli geometry. A residual synchronization analysis separates ordinary graph cycles from gauge-invariant parity constraints, and four atomic Jordan–Lie anchors are necessary and sufficient, within the declared anchor class, to reduce the remaining scale and sign freedom to Clifford gauge. An explicit relative-defect rigidity modulus and a protocol-conditioned end-to-end error certificate are obtained. The result does not claim that probabilities alone determine a physical tensor-product structure. Rather, unpartitioned process data together with a finite relational anchor package robustly identify a subsystem frame up to the declared gauge.
Many quantum technologies are now reaching a high level of maturity and control, and it is likely that the first demonstrations of suppression of naturally occurring quantum noise using small topological error correcting codes will soon be possible. In doing this it will be necessary to define clear achievable metrics to measure and compare the performance of real codes. Here we consider the smallest examples of several families of topological codes: surface codes, color codes, and the gauge color code, and determine the minimum requirements to demonstrate error suppression. We use an exact decoder to compare the performance of the codes under simple models of both physical error and measurement error, and determine regions of correctability in the physical parameters for each code.