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

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

The Institute for Applied Ontological Mathematics

Published Oct 11, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.23304178

Related papers

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

Apoth3osis Labs, goodman Richard, Veselov Vladimir

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.

•Apr 21, 2026•0 citations

Contextuality under characterized loss: quantifying missing contextual information via channel-transported relative entropy

Arash E. Zaghi, Ofer Harel, Kun Chen

Abstract Relative-entropy measures of contextuality quantify the statistical distance between an empirical model and the noncontextual set. We study how this established quantity changes when an experiment is observed through a characterized loss mechanism. Each attempted trial is retained in the analysis, with missed outcomes represented by context-labeled no-click symbols, and the same stochastic observation channel is applied to the target model and every noncontextual comparator. Under this common-channel transportability assumption, the data-processing inequality gives an observed-data contextual divergence that cannot exceed its complete-data value. We define the absolute contextual-information loss and its normalized ratio, the fraction of missing contextual information (FMCI). We prove general reference-set contraction, exact scaling under missing completely at random loss, a cellwise erasure sandwich, a no-exact-hiding result under strictly positive retention, and additive and multiplicative decompositions for sequential design and detector channels. We also separate response dependence from disturbance of shared marginals and clarify why outcomes of unchosen incompatible contexts are not model-neutral missing entries. The theory is evaluated on the perfect-anticorrelation three-cycle, the Klyachko–Can–Binicioğlu–Shumovsky pentagon, and the Peres–Mermin magic square. The hidden-variable and inequality-constrained optimizations agree to within 10 − 12 nats. Exhaustive enumeration of all 104 context subcovers shows that, for these three canonical benchmark points, every proper subcover is noncontextual. A 51 × 51 scan of a tunable outcome-dependent loss family confirms that exact population hiding occurs only on the zero-retention boundary, while finite-sample detectability can deteriorate well before that boundary. For a known finite-alphabet erasure channel with cellwise retention probabilities we give an exact identification criterion, regular asymptotic and Fieller inference for FMCI, and diagnostics that withhold scalar ratio inference near the noncontextual boundary. Unknown outcome-dependent loss is handled by a calibration-constrained sensitivity workflow and union confidence sets. FMCI is therefore a conditional diagnostic of information attenuation under a declared observation channel, not a replacement for loophole-free contextuality certification.

New Journal of Physics•Aug 1, 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

The canonical class of the MASA context stack and the Peres-Mermin obstruction

Manuel Flores Gordillo

Quantum measurements need not reveal preexisting values: the outcome assigned to an observable can depend on which compatible observables are measured with it. This contextuality underlies the Peres-Mermin proof of the Kochen-Specker theorem and, in quantum computation with magic states, tracks the even/odd parity of the local dimension separating the classically simulable from the genuinely quantum. ATTRIBUTION: the even/odd value classification of state-independent qudit contextuality (the parity dichotomy and the fixed obstruction value d/2) is due to Abramsky, Cercelescu and Constantin, FSCD 2024; this paper supplies its geometric and cohomological ACCOUNT, not a rediscovery of it. Organizing all measurement contexts of M_n(C) into the stack [X/PU(n)] of maximal abelian subalgebras, we show the lifting class of U(1) -> U(n) -> PU(n) is vacuous on the action groupoid U(n) x X but, on PU(n) x X, is a canonical degree-2 class of order exactly n. Its real shadow, through the signed-permutation group B_n, is a Z_2 extension splitting if and only if n is odd, with "-I is a rotation square iff n is even" as the mechanism; at n=4 it restricts to the real two-qubit Pauli class, whose pairing with the Peres-Mermin word is -1, exactly the obstruction to a noncontextual value assignment. We compute H^2 = Z/n (+) Z_2 for n >= 4 and identify the canonical class as a generator of the Z/n summand. STATUS AND SCOPE. Every step is tagged Complete, Sketch (reduced to a named standard theorem whose hypotheses are verified), or Gap, and a status table closes the paper. The finite and algebraic core is machine-checked by scripts in the public suite. The geometric layer rests on standard but non-elementary facts about differentiable-stack cohomology and the Lyndon-Hochschild-Serre spectral sequence; that bookkeeping is reduced to named standard theorems and AWAITS SPECIALIST REVIEW. This is a preprint, not a peer-reviewed article, and should be read at that strength. The finite Weyl value spectrum is developed in a companion paper. Code, data and verification suite: https://github.com/manuflog/contextuality-obstructions Note on methods: large-language-model assistants (Anthropic Claude) were used substantially in drafting, in developing the verification scripts, in literature search and in proposing proofs. Every load-bearing claim is machine-verified independently of that assistance, and the author takes full responsibility for the results, including any errors.

•Jul 27, 2026•0 citations

Information structures and their cohomology

Juan Pablo Vigneaux

We introduce the category of information structures, whose objects are suitable diagrams of measurable sets that encode the possible outputs of a given family of observables and their mutual relationships of refinement; they serve as mathematical models of contextuality in classical and quantum settings.Each information structure can be regarded as a ringed site with trivial topology; the structure ring is generated by the observables themselves and its multiplication corresponds to joint measurement.We extend Baudot and Bennequin's definition of information cohomology to this setting, as a derived functor in the category of modules over the structure ring, and show explicitly that the bar construction gives a projective resolution in that category, recovering in this way the cochain complexes previously considered in the literature.Finally, we study the particular case of a one-parameter family of coefficients made of functions of probability distributions.The only 1-cocycles are Shannon entropy or Tsallis α-entropy, depending on the value of the parameter.

arXiv:1709.07807•Theory and applications of categories•Jan 1, 2020•21 citations

Comparing two cohomological obstructions for contextuality, and a generalised construction of quantum advantage with shallow circuits

Sivert Aasnaess

We present two results on the subject of quantum contextuality and cohomology, and non-locality and quantum advantage with shallow circuits. Abramsky et al. showed that a range of examples of quantum contextuality is detected by a cohomological invariant based on Čech cohomology. However, the approach does not give a complete cohomological characterisation of contextuality. A different cohomological approach to contextuality was introduced by Okay et al. Their approach exploits the algebraic structure of the Pauli operators and their qudit generalisations known as Weyl operators. We give an abstract account of this structure, then generalise their approach to any example of contextuality with this structure. We prove at this general level that the approach does not give a more complete characterisation of contextuality than the Čech cohomology approach. Bravyi, Gosset, and König (BGK) gave the first unconditional proof that a restricted class of quantum circuits is more powerful than its classical analogue. The result, for the class of circuits of bounded depth and fan-in (shallow circuits), exploits a particular family of examples of contextuality. BGK's quantum circuit and computational problem are derived from a family of non-local games related to the well-known GHZ non-local game. We present a generalised version of their construction. A systematic way of taking examples of contextuality and producing unconditional quantum advantage results with shallow circuits.

arXiv:2212.09382•Dec 19, 2022•8 citations
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.
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.
Abstract Relative-entropy measures of contextuality quantify the statistical distance between an empirical model and the noncontextual set. We study how this established quantity changes when an experiment is observed through a characterized loss mechanism. Each attempted trial is retained in the analysis, with missed outcomes represented by context-labeled no-click symbols, and the same stochastic observation channel is applied to the target model and every noncontextual comparator. Under this common-channel transportability assumption, the data-processing inequality gives an observed-data contextual divergence that cannot exceed its complete-data value. We define the absolute contextual-information loss and its normalized ratio, the fraction of missing contextual information (FMCI). We prove general reference-set contraction, exact scaling under missing completely at random loss, a cellwise erasure sandwich, a no-exact-hiding result under strictly positive retention, and additive and multiplicative decompositions for sequential design and detector channels. We also separate response dependence from disturbance of shared marginals and clarify why outcomes of unchosen incompatible contexts are not model-neutral missing entries. The theory is evaluated on the perfect-anticorrelation three-cycle, the Klyachko–Can–Binicioğlu–Shumovsky pentagon, and the Peres–Mermin magic square. The hidden-variable and inequality-constrained optimizations agree to within 10 − 12 nats. Exhaustive enumeration of all 104 context subcovers shows that, for these three canonical benchmark points, every proper subcover is noncontextual. A 51 × 51 scan of a tunable outcome-dependent loss family confirms that exact population hiding occurs only on the zero-retention boundary, while finite-sample detectability can deteriorate well before that boundary. For a known finite-alphabet erasure channel with cellwise retention probabilities we give an exact identification criterion, regular asymptotic and Fieller inference for FMCI, and diagnostics that withhold scalar ratio inference near the noncontextual boundary. Unknown outcome-dependent loss is handled by a calibration-constrained sensitivity workflow and union confidence sets. FMCI is therefore a conditional diagnostic of information attenuation under a declared observation channel, not a replacement for loophole-free contextuality certification.
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.
Quantum measurements need not reveal preexisting values: the outcome assigned to an observable can depend on which compatible observables are measured with it. This contextuality underlies the Peres-Mermin proof of the Kochen-Specker theorem and, in quantum computation with magic states, tracks the even/odd parity of the local dimension separating the classically simulable from the genuinely quantum. ATTRIBUTION: the even/odd value classification of state-independent qudit contextuality (the parity dichotomy and the fixed obstruction value d/2) is due to Abramsky, Cercelescu and Constantin, FSCD 2024; this paper supplies its geometric and cohomological ACCOUNT, not a rediscovery of it. Organizing all measurement contexts of M_n(C) into the stack [X/PU(n)] of maximal abelian subalgebras, we show the lifting class of U(1) -> U(n) -> PU(n) is vacuous on the action groupoid U(n) x X but, on PU(n) x X, is a canonical degree-2 class of order exactly n. Its real shadow, through the signed-permutation group B_n, is a Z_2 extension splitting if and only if n is odd, with "-I is a rotation square iff n is even" as the mechanism; at n=4 it restricts to the real two-qubit Pauli class, whose pairing with the Peres-Mermin word is -1, exactly the obstruction to a noncontextual value assignment. We compute H^2 = Z/n (+) Z_2 for n >= 4 and identify the canonical class as a generator of the Z/n summand. STATUS AND SCOPE. Every step is tagged Complete, Sketch (reduced to a named standard theorem whose hypotheses are verified), or Gap, and a status table closes the paper. The finite and algebraic core is machine-checked by scripts in the public suite. The geometric layer rests on standard but non-elementary facts about differentiable-stack cohomology and the Lyndon-Hochschild-Serre spectral sequence; that bookkeeping is reduced to named standard theorems and AWAITS SPECIALIST REVIEW. This is a preprint, not a peer-reviewed article, and should be read at that strength. The finite Weyl value spectrum is developed in a companion paper. Code, data and verification suite: https://github.com/manuflog/contextuality-obstructions Note on methods: large-language-model assistants (Anthropic Claude) were used substantially in drafting, in developing the verification scripts, in literature search and in proposing proofs. Every load-bearing claim is machine-verified independently of that assistance, and the author takes full responsibility for the results, including any errors.
We introduce the category of information structures, whose objects are suitable diagrams of measurable sets that encode the possible outputs of a given family of observables and their mutual relationships of refinement; they serve as mathematical models of contextuality in classical and quantum settings.Each information structure can be regarded as a ringed site with trivial topology; the structure ring is generated by the observables themselves and its multiplication corresponds to joint measurement.We extend Baudot and Bennequin's definition of information cohomology to this setting, as a derived functor in the category of modules over the structure ring, and show explicitly that the bar construction gives a projective resolution in that category, recovering in this way the cochain complexes previously considered in the literature.Finally, we study the particular case of a one-parameter family of coefficients made of functions of probability distributions.The only 1-cocycles are Shannon entropy or Tsallis α-entropy, depending on the value of the parameter.
We present two results on the subject of quantum contextuality and cohomology, and non-locality and quantum advantage with shallow circuits. Abramsky et al. showed that a range of examples of quantum contextuality is detected by a cohomological invariant based on Čech cohomology. However, the approach does not give a complete cohomological characterisation of contextuality. A different cohomological approach to contextuality was introduced by Okay et al. Their approach exploits the algebraic structure of the Pauli operators and their qudit generalisations known as Weyl operators. We give an abstract account of this structure, then generalise their approach to any example of contextuality with this structure. We prove at this general level that the approach does not give a more complete characterisation of contextuality than the Čech cohomology approach. Bravyi, Gosset, and König (BGK) gave the first unconditional proof that a restricted class of quantum circuits is more powerful than its classical analogue. The result, for the class of circuits of bounded depth and fan-in (shallow circuits), exploits a particular family of examples of contextuality. BGK's quantum circuit and computational problem are derived from a family of non-local games related to the well-known GHZ non-local game. We present a generalised version of their construction. A systematic way of taking examples of contextuality and producing unconditional quantum advantage results with shallow circuits.