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

The Sign Is the Boundary

The Institute for Applied Ontological Mathematics

Published Oct 11, 2026• 0 citations
Publisher

Abstract

Two islands of exact tractability are usually told as separate stories. On one, a discrete sum over an exponential configuration space collapses because the interaction graph is thin: variable elimination contracts it in time governed by treewidth, and a frustrated but narrow spin glass is summed exactly. On the other, a fermionic amplitude that looks exponential collapses because the system is free: a Gaussian (matchgate) circuit is a Pfaffian, computable in polynomial time. We show these are not two algorithms but one, run in two rings, and that the entire structural difference between them — the difference that separates the classical island from the quantum one — is a single sign. Exact elimination in a commutative ring is the classical sum-product engine; the same elimination in a graded-commutative ring, where transposing two generators costs a factor of −1, is the free-fermion Pfaffian. We prove the order-independence of elimination in a formal kernel; we build the graded product and prove that its four-mode Gaussian contraction equals the Pfaffian, as a polynomial identity over any commutative ring; we prove Pf 2 = det, lowering the amplitude to bare linear algebra and carrying a non-interacting molecular Hamiltonian through it. Crucially, we show the boundary is load-bearing and decidable: deleting the Koszul sign is a one-line mutation, and a kernel-checked substitution-body probe certifies that it changes a worked value from −15 to +15 — the sign is not decoration, it is the whole difference. Pushing the abstraction one turn further, we free the sign itself to a phase: the same contraction becomes a one-parameter family Pf ζ over the circle of braidings, and a kernel proof shows that bosons (ζ = +1) and fermions (ζ = −1) are its only two symmetric points — the solution set of ζ 2 = 1 — while √ every other root of unity is an anyon, the −1 quarter-turn already yielding an amplitude no sign can produce. The classical–quantum boundary is, in full, a point on a circle, and the sign is its fermionic antipode. Around this we build a measured-capability router: a functor that never routes an instance above a measured envelope, whose order-preservation law is proved with an empty axiom footprint, and whose decision is an exact integer comparison of table sizes. The result is a single certified contraction platform that computes classical inference, frustrated-magnet thermodynamics, and non-interacting electronic structure through one engine, lowered to an operator-native reduction net and closed with a replayable receipt. The honesty boundary is stated up front: both islands are special tractable classes, not all of computation; what changes at their border is exactly the sign, and nothing we build claims otherwise. Published by The Institute for Applied Ontological Mathematics.

DOI
10.5281/zenodo.23304009

Related papers

Classical simulation of free-fermionic dynamics and quantum chemistry with magic input

Changhun Oh, Michał Oszmaniec, Oliver Reardon-Smith +1 more

Establishing the precise computational boundary between classically tractable fermionic systems and those capable of genuine quantum advantage is a central challenge in quantum simulation. While injecting non-Gaussian ``magic" inputs into free-fermion circuits is widely expected to generate intractable complexity, we identify a physically motivated intermediate regime. We prove that for block-product paired non-Gaussian fermionic states, essential quantum simulation primitives -- transition amplitudes, overlaps, and arbitrary-weight number correlators -- can be efficiently approximated to additive error under free-fermionic dynamics. This tractability stems from an algebraic reduction that compresses exponentially large multiparticle interference into a single coefficient of a multivariate Pfaffian polynomial. Because these classical estimators match the intrinsic $O(1/\sqrt{K})$ statistical uncertainty of quantum hardware utilizing $K$ measurement shots, they constitute a practical benchmark. Building on this foundation, we construct an additive-error estimator for high-weight Wilson observables in the noninteracting quench of recent trapped-ion experiments, providing a rigorous classical benchmark. Extending this to quantum chemistry, we demonstrate that core overlap-based subroutines for antisymmetrized products of strongly orthogonal geminals admit efficient additive-error Pfaffian-kernel estimators. Ultimately, these results sharpen the boundary of quantum advantage, establishing that the paired-electron scaffold is dequantized and clarifying where quantum resources are indispensable.

quant-pharXiv:2604.26813•Apr 30, 2026•11 citations

The Anyon Amplitude Is an Algebraic Integer: Exact, Cross-Validated, Kernel-Checked Topological Quantum Computation

The Institute for Applied Ontological Mathematics

A Fibonacci-anyon quantum computer evaluates the Jones polynomial of a knot at a fifth root of unity; the value is the amplitude of a braiding process. We show that this value is an algebraic integer—it lives in the cyclotomic ring Z[ζ5 ]—and that a classical machine can therefore compute it exactly, with no floating point and no Hilbert space, and a proof kernel can certify that it did. The braiding gates become 2 × 2 matrices over Z[ζ5 ] in which the golden ratio satisfies φ2 = φ + 1 as an arithmetic identity; the Kauffman loop value is φ on the nose. We build the amplitude two independent ways—an algebraic Temperley–Lieb trace and a topological state sum that counts loops in a closed braid diagram—and the two agree, bit for bit, on the unknot, the Hopf link, the trefoil, and the figure-eight (the first knot that is not a torus link). Writhe normalization turns the framed value into a genuine link invariant, and we prove its invariance: under Reidemeister I and Markov conjugation—in general, for every braid, by showing the matrix trace over Z[ζ5 ] is cyclic—and under Markov stabilization of either sign for every braid, since the union–find loop count is sign-independent and the spectator surgery closes σ and σ −1 alike (framing factors −A3 and −A−3 ). A diagrammatic runtime recovers the Temperley–Lieb relations not as axioms but as theorems that fall out of contracting wires and collapsing loops. We prove, in the kernel, that the loop count the topological engine returns is the number of connected components of the closed braid diagram—a verified union–find theory whose load-bearing fact is that one merge step drops the component count by exactly one—which reduces the last step of the general invariance theorem to a single component-count comparison. Against an independent floating-point recomputation the exact values agree to 1.3 × 10−15 , the residual being the float error, not ours. The naive state sum is exponential, but it need not be: a confluent reduction that carries the whole Temperley–Lieb element and merges equal diagrams computes the same amplitude in time polynomial in the crossings for braids of bounded strand width, and the kernel certifies it equals the exponential sum—for a torus link σ1k , a collapse from 2k to O(k). Every result is machine-checked in Cubical Agda. We do not claim a quantum speedup, and we do not overturn the #P-hardness of the general problem; what we show is that the classical amplitude is an exact object, that exactness can be certified, and that the certified computation is—in the bounded-width regime—exponentially faster than the simulation it replaces. The same construction carries the Ising anyon over the ring Z[ζ16 ]: the two theories are two evaluation points of one bracket polynomial, and the gap between the universal model and √ the classically-simulable one is, at the level of the ring, the gap between φ2 = φ + 1 and ( 2)2 = 2. Because equality in Z[ζ5 ] is decidable, the exact invariant decides topology a float cannot: we prove the trefoil is chiral—its invariant differs from its mirror's, exactly—and the figure-eight amphichiral. Published by The Institute for Applied Ontological Mathematics.

•Oct 11, 2026•0 citations

Unifying and Extending Strong Simulation of Quantum Circuits

Floris Geerts, Rihan Hai, Matthias Lanzinger +3 more

We establish functional aggregate queries (FAQs) as a unifying language for exact classical simulation of quantum circuits. A circuit becomes a sum-product query: factors encode gates, internal wire variables are aggregated, and free boundary variables index transition amplitudes. The central insight is that distinct sources of simulation tractability can be exploited within the same InsideOut evaluation scheme. The query specifies what is computed; the evaluation plan, semiring, and representation of intermediate factors determine the cost. This view unifies structural and algebraic simulation guarantees. With explicit factor representations, FAQ evaluation recovers the treewidth bound for tensor-network contraction and yields finer sparsity-sensitive bounds via fractional covers. Over a formal phase semiring, compressed intermediate factors recover rank-width-based simulation for compatible quadratic phase representations. For Clifford circuits, affine-quadratic factors are closed under multiplication and marginalization and remain polynomial in size, yielding polynomial-time exact amplitude computation without any bounded-width assumption. Beyond these recoveries, the framework yields a new tractability criterion: tensor layout symmetry width. This parameter combines local cut-rank with separator symmetry through exact tree-tensor representations. We give a constructive evaluation bound and exhibit a circuit family with bounded tensor layout symmetry width but unbounded phase-graph rank-width and circuit line-graph treewidth. These results establish representation-aware FAQ evaluation as a common algorithmic foundation for classical simulation and a systematic route to new tractable regimes.

quant-pharXiv:2610.00547•Oct 2, 2026•0 citations

The Offset Belongs to the Boundary: the trace split of the entanglement Hamiltonian, a measured Clausius region, and an offset with no bulk

Jeromie Beasley

For a region of a free-fermion ground state the entanglement Hamiltonian K_A = log[(1 - C_A) C_A^-1] splits into a part proportional to the identity and a trace-free remainder. The identity part shifts every level rigidly, so every observable built from level differences is blind to it. This paper is about that part. It is not a bulk quantity. The block carries one ladder per entangling cut, the trace is the difference of the two cut-phase charges, and on the exactly dimerised chain with a single cut carrying the whole charge it has the closed form 2 artanh(v / sqrt(v^2 + t^2)), derived in one line and measured to 10^-11. In exact arithmetic the trace is a definite number: zero to thirty-three digits when the two cut phases agree, and 0.786153199019314523 when they do not. The apparent divergence reported in earlier work was double-precision truncation of a finite sum, and is retired here. Along the two lines through the Rice-Mele plane where the half-line entanglement Hamiltonian is known in closed form, it is proportional to the Bisognano-Wichmann deformation T = (1/2){X, H} with no additive constant, and the ladder spacing and phase are fixed by the literature. Between those lines the commuting operator survives, measured at 10^-13 against controls that fail at 1.5 and 29, but the proportionality does not: the level map acquires an intercept b that is zero to 3 x 10^-9 on both lines and of order 10^-1 in the interior, and is identical whether the region has one entangling cut or two. That intercept is the measured failure of exact Bisognano-Wichmann proportionality. At first order in the staggering v the intercept is derived rather than fitted. The symbol's determinant is det(z - P) = z(z - 1) independently of momentum, so the factorisation is canonical everywhere; its logarithm is affine in an involution R = H/E with R^2 = I; the abelian Szego-type boundary functional is identically even in v and therefore cannot carry an odd intercept; and the first-order piece follows from the chiral zero mode of the dimerised chain, whose amplitudes are (-r)^j C(2j,j) 4^-j in closed form. The result is b/v = 2(E' - K')/(1 - r^2) + K', K' = K(1 - r^2), E' = E(1 - r^2), r = t1/t2, whose expansion in the modulus u is, in exact rationals, h(u)/(pi/8) = 1 - (5/8) u^2 - (9/64) u^4 - (65/1024) u^6 - (595/16384) u^8 - ... So pi/8, -5/8 and -9/64 are consequences rather than recognitions, and the natural elliptic candidate [9E - K]/16 - pi/8 is excluded by 7.7 percent on the first coefficient it does not get to choose. The closed form agrees with direct measurement extrapolated to v -> 0 by two to three orders better than the fitted series it replaces; a previously reported u^6 coefficient of -0.0648 is corrected here to -65/1024 and identified as truncation. The trace-free half is treated in parallel. A Clausius relation with a single temperature holds exactly when that half is proportional to the region's own Hamiltonian. At a ground state it never is, and the measured temperature is zero, which is correct rather than a failure. In a thermal state the same instrument returns 1/beta to five significant figures, and the boundary of the region where it does so collapses onto two dimensionless ratios. Two further results are included. The offset vanishes when the two cuts sit at the same phase in the unit cell, without requiring chirality, time reversal, inversion or cleanliness, and a mirror-symmetrised disordered chain gives a larger offset than its unsymmetrised control, which rules reflection out as the mechanism. And in two dimensions the offset is exactly additive along the boundary for a transverse coupling proportional to the identity in sublattice space, for a reason short enough to state, with a derived crossing past which additivity fails and a sigma_z coupling that breaks it smoothly. Every claim carries one of four grades: [T] proven here, [V] computationally verified with stated controls and a stated failure mode, [C] imported from the cited literature, [H] interpretation. The two exact lines, the commuting deformation, the boundary-locality of the entanglement spectrum, and the first law of entanglement entropy are not this work's and are used as given. Sixteen retired claims, including two withdrawn from earlier versions of this manuscript, are listed with the measurement that killed each. Files in this deposit: the_offset_belongs_to_the_boundary_v8_submission.pdf — 35 pages, gate output verbatim, script listings supplied separately. the_offset_belongs_to_the_boundary_v8_complete.pdf — 59 pages, identical body with all scripts printed inline. offset_v8_scripts.zip — 23 files. Every number quoted in the paper is printed by one of them; the two gate files reproduce their stored output byte for byte. KEYWORDS entanglement Hamiltonian; entanglement spectrum; modular Hamiltonian; Bisognano-Wichmann; Rice-Mele model; SSH model; free fermions; boundary charge; cut-phase charge; corner transfer matrix; Toeplitz operators; Wiener-Hopf factorisation; Szego-Widom asymptotics; algebraic Heun operator; complete elliptic integrals; entanglement first law; area law; Landau-Widom counting function ADDITIONAL NOTES Supersedes earlier versions of this manuscript. Two claims present in versions 1 to 3 are withdrawn and recorded in the kill list: that the incommensurate offset has no value, and that the offset is one quantum. Both were double-precision truncation of a finite sum. The u^6 coefficient of the shape function reported in the companion results ledger is likewise superseded by the derived value. Computational verification, gating and drafting assistance by an AI collaborator (Claude, Anthropic). Every gate is independently re-runnable from the ancillary scripts.

•Aug 31, 2026•0 citations

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation

Alexis de Colnet, Floris Geerts, Rihan Hai +3 more

Strongly simulating a quantum circuit, that is, computing an output amplitude, can be done by summing the circuit's Feynman paths: a weighted count over assignments to Boolean path variables. The circuit's gates induce correlations among these variables, forming a graph whose structure controls several exact simulation routes. This sum-of-powers (SOP) viewpoint underlies recent simulators built on binary decision diagrams and weighted model counting. For a quadratic SOP with $n$ variables, even modulus $r$, and a rank-decomposition of its variable graph of width $k$, our dynamic program (DP) computes an amplitude using only $O(4^kpoly(n))$ arithmetic operations. For Clifford$+T$ circuits, the amplitude is given by an SOP with modulus $8$. Rank-width never exceeds linear rank-width, which governs some decision-diagram approaches, and is at most one greater than the Markov--Shi contraction complexity of the circuit tensor network. Moreover, there are non-Clifford families of bounded rank-width where both competing parameters diverge. We also present a stabilizer-rank optimization, exploiting that the DP tables are stabilizer-type Gauss sums. Each subtree runs at the width price of its cut-ranks or at a magic price that discharges the non-Clifford phases below it. The resulting best total cost never exceeds $O(4^kpoly(n))$, yet is polynomial on mixed families where the pure rank-width and pure $T$-count guarantees are both exponential. Clifford amplitudes take polynomial time on any graph, the exact-amplitude consequence of Gottesman--Knill. A prototype evaluation on standard circuit benchmarks finds treewidth bucket elimination the strongest baseline, with the new rank-width DP complementary: it wins on structured families where treewidth blows up.

quant-pharXiv:2605.29944•May 29, 2026•3 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
Two islands of exact tractability are usually told as separate stories. On one, a discrete sum over an exponential configuration space collapses because the interaction graph is thin: variable elimination contracts it in time governed by treewidth, and a frustrated but narrow spin glass is summed exactly. On the other, a fermionic amplitude that looks exponential collapses because the system is free: a Gaussian (matchgate) circuit is a Pfaffian, computable in polynomial time. We show these are not two algorithms but one, run in two rings, and that the entire structural difference between them — the difference that separates the classical island from the quantum one — is a single sign. Exact elimination in a commutative ring is the classical sum-product engine; the same elimination in a graded-commutative ring, where transposing two generators costs a factor of −1, is the free-fermion Pfaffian. We prove the order-independence of elimination in a formal kernel; we build the graded product and prove that its four-mode Gaussian contraction equals the Pfaffian, as a polynomial identity over any commutative ring; we prove Pf 2 = det, lowering the amplitude to bare linear algebra and carrying a non-interacting molecular Hamiltonian through it. Crucially, we show the boundary is load-bearing and decidable: deleting the Koszul sign is a one-line mutation, and a kernel-checked substitution-body probe certifies that it changes a worked value from −15 to +15 — the sign is not decoration, it is the whole difference. Pushing the abstraction one turn further, we free the sign itself to a phase: the same contraction becomes a one-parameter family Pf ζ over the circle of braidings, and a kernel proof shows that bosons (ζ = +1) and fermions (ζ = −1) are its only two symmetric points — the solution set of ζ 2 = 1 — while √ every other root of unity is an anyon, the −1 quarter-turn already yielding an amplitude no sign can produce. The classical–quantum boundary is, in full, a point on a circle, and the sign is its fermionic antipode. Around this we build a measured-capability router: a functor that never routes an instance above a measured envelope, whose order-preservation law is proved with an empty axiom footprint, and whose decision is an exact integer comparison of table sizes. The result is a single certified contraction platform that computes classical inference, frustrated-magnet thermodynamics, and non-interacting electronic structure through one engine, lowered to an operator-native reduction net and closed with a replayable receipt. The honesty boundary is stated up front: both islands are special tractable classes, not all of computation; what changes at their border is exactly the sign, and nothing we build claims otherwise. Published by The Institute for Applied Ontological Mathematics.
Establishing the precise computational boundary between classically tractable fermionic systems and those capable of genuine quantum advantage is a central challenge in quantum simulation. While injecting non-Gaussian ``magic" inputs into free-fermion circuits is widely expected to generate intractable complexity, we identify a physically motivated intermediate regime. We prove that for block-product paired non-Gaussian fermionic states, essential quantum simulation primitives -- transition amplitudes, overlaps, and arbitrary-weight number correlators -- can be efficiently approximated to additive error under free-fermionic dynamics. This tractability stems from an algebraic reduction that compresses exponentially large multiparticle interference into a single coefficient of a multivariate Pfaffian polynomial. Because these classical estimators match the intrinsic O(1/K)O(1/\sqrt{K})O(1/K​) statistical uncertainty of quantum hardware utilizing KKK measurement shots, they constitute a practical benchmark. Building on this foundation, we construct an additive-error estimator for high-weight Wilson observables in the noninteracting quench of recent trapped-ion experiments, providing a rigorous classical benchmark. Extending this to quantum chemistry, we demonstrate that core overlap-based subroutines for antisymmetrized products of strongly orthogonal geminals admit efficient additive-error Pfaffian-kernel estimators. Ultimately, these results sharpen the boundary of quantum advantage, establishing that the paired-electron scaffold is dequantized and clarifying where quantum resources are indispensable.
A Fibonacci-anyon quantum computer evaluates the Jones polynomial of a knot at a fifth root of unity; the value is the amplitude of a braiding process. We show that this value is an algebraic integer—it lives in the cyclotomic ring Z[ζ5 ]—and that a classical machine can therefore compute it exactly, with no floating point and no Hilbert space, and a proof kernel can certify that it did. The braiding gates become 2 × 2 matrices over Z[ζ5 ] in which the golden ratio satisfies φ2 = φ + 1 as an arithmetic identity; the Kauffman loop value is φ on the nose. We build the amplitude two independent ways—an algebraic Temperley–Lieb trace and a topological state sum that counts loops in a closed braid diagram—and the two agree, bit for bit, on the unknot, the Hopf link, the trefoil, and the figure-eight (the first knot that is not a torus link). Writhe normalization turns the framed value into a genuine link invariant, and we prove its invariance: under Reidemeister I and Markov conjugation—in general, for every braid, by showing the matrix trace over Z[ζ5 ] is cyclic—and under Markov stabilization of either sign for every braid, since the union–find loop count is sign-independent and the spectator surgery closes σ and σ −1 alike (framing factors −A3 and −A−3 ). A diagrammatic runtime recovers the Temperley–Lieb relations not as axioms but as theorems that fall out of contracting wires and collapsing loops. We prove, in the kernel, that the loop count the topological engine returns is the number of connected components of the closed braid diagram—a verified union–find theory whose load-bearing fact is that one merge step drops the component count by exactly one—which reduces the last step of the general invariance theorem to a single component-count comparison. Against an independent floating-point recomputation the exact values agree to 1.3 × 10−15 , the residual being the float error, not ours. The naive state sum is exponential, but it need not be: a confluent reduction that carries the whole Temperley–Lieb element and merges equal diagrams computes the same amplitude in time polynomial in the crossings for braids of bounded strand width, and the kernel certifies it equals the exponential sum—for a torus link σ1k , a collapse from 2k to O(k). Every result is machine-checked in Cubical Agda. We do not claim a quantum speedup, and we do not overturn the #P-hardness of the general problem; what we show is that the classical amplitude is an exact object, that exactness can be certified, and that the certified computation is—in the bounded-width regime—exponentially faster than the simulation it replaces. The same construction carries the Ising anyon over the ring Z[ζ16 ]: the two theories are two evaluation points of one bracket polynomial, and the gap between the universal model and √ the classically-simulable one is, at the level of the ring, the gap between φ2 = φ + 1 and ( 2)2 = 2. Because equality in Z[ζ5 ] is decidable, the exact invariant decides topology a float cannot: we prove the trefoil is chiral—its invariant differs from its mirror's, exactly—and the figure-eight amphichiral. Published by The Institute for Applied Ontological Mathematics.
We establish functional aggregate queries (FAQs) as a unifying language for exact classical simulation of quantum circuits. A circuit becomes a sum-product query: factors encode gates, internal wire variables are aggregated, and free boundary variables index transition amplitudes. The central insight is that distinct sources of simulation tractability can be exploited within the same InsideOut evaluation scheme. The query specifies what is computed; the evaluation plan, semiring, and representation of intermediate factors determine the cost. This view unifies structural and algebraic simulation guarantees. With explicit factor representations, FAQ evaluation recovers the treewidth bound for tensor-network contraction and yields finer sparsity-sensitive bounds via fractional covers. Over a formal phase semiring, compressed intermediate factors recover rank-width-based simulation for compatible quadratic phase representations. For Clifford circuits, affine-quadratic factors are closed under multiplication and marginalization and remain polynomial in size, yielding polynomial-time exact amplitude computation without any bounded-width assumption. Beyond these recoveries, the framework yields a new tractability criterion: tensor layout symmetry width. This parameter combines local cut-rank with separator symmetry through exact tree-tensor representations. We give a constructive evaluation bound and exhibit a circuit family with bounded tensor layout symmetry width but unbounded phase-graph rank-width and circuit line-graph treewidth. These results establish representation-aware FAQ evaluation as a common algorithmic foundation for classical simulation and a systematic route to new tractable regimes.
For a region of a free-fermion ground state the entanglement Hamiltonian K_A = log[(1 - C_A) C_A^-1] splits into a part proportional to the identity and a trace-free remainder. The identity part shifts every level rigidly, so every observable built from level differences is blind to it. This paper is about that part. It is not a bulk quantity. The block carries one ladder per entangling cut, the trace is the difference of the two cut-phase charges, and on the exactly dimerised chain with a single cut carrying the whole charge it has the closed form 2 artanh(v / sqrt(v^2 + t^2)), derived in one line and measured to 10^-11. In exact arithmetic the trace is a definite number: zero to thirty-three digits when the two cut phases agree, and 0.786153199019314523 when they do not. The apparent divergence reported in earlier work was double-precision truncation of a finite sum, and is retired here. Along the two lines through the Rice-Mele plane where the half-line entanglement Hamiltonian is known in closed form, it is proportional to the Bisognano-Wichmann deformation T = (1/2){X, H} with no additive constant, and the ladder spacing and phase are fixed by the literature. Between those lines the commuting operator survives, measured at 10^-13 against controls that fail at 1.5 and 29, but the proportionality does not: the level map acquires an intercept b that is zero to 3 x 10^-9 on both lines and of order 10^-1 in the interior, and is identical whether the region has one entangling cut or two. That intercept is the measured failure of exact Bisognano-Wichmann proportionality. At first order in the staggering v the intercept is derived rather than fitted. The symbol's determinant is det(z - P) = z(z - 1) independently of momentum, so the factorisation is canonical everywhere; its logarithm is affine in an involution R = H/E with R^2 = I; the abelian Szego-type boundary functional is identically even in v and therefore cannot carry an odd intercept; and the first-order piece follows from the chiral zero mode of the dimerised chain, whose amplitudes are (-r)^j C(2j,j) 4^-j in closed form. The result is b/v = 2(E' - K')/(1 - r^2) + K', K' = K(1 - r^2), E' = E(1 - r^2), r = t1/t2, whose expansion in the modulus u is, in exact rationals, h(u)/(pi/8) = 1 - (5/8) u^2 - (9/64) u^4 - (65/1024) u^6 - (595/16384) u^8 - ... So pi/8, -5/8 and -9/64 are consequences rather than recognitions, and the natural elliptic candidate [9E - K]/16 - pi/8 is excluded by 7.7 percent on the first coefficient it does not get to choose. The closed form agrees with direct measurement extrapolated to v -> 0 by two to three orders better than the fitted series it replaces; a previously reported u^6 coefficient of -0.0648 is corrected here to -65/1024 and identified as truncation. The trace-free half is treated in parallel. A Clausius relation with a single temperature holds exactly when that half is proportional to the region's own Hamiltonian. At a ground state it never is, and the measured temperature is zero, which is correct rather than a failure. In a thermal state the same instrument returns 1/beta to five significant figures, and the boundary of the region where it does so collapses onto two dimensionless ratios. Two further results are included. The offset vanishes when the two cuts sit at the same phase in the unit cell, without requiring chirality, time reversal, inversion or cleanliness, and a mirror-symmetrised disordered chain gives a larger offset than its unsymmetrised control, which rules reflection out as the mechanism. And in two dimensions the offset is exactly additive along the boundary for a transverse coupling proportional to the identity in sublattice space, for a reason short enough to state, with a derived crossing past which additivity fails and a sigma_z coupling that breaks it smoothly. Every claim carries one of four grades: [T] proven here, [V] computationally verified with stated controls and a stated failure mode, [C] imported from the cited literature, [H] interpretation. The two exact lines, the commuting deformation, the boundary-locality of the entanglement spectrum, and the first law of entanglement entropy are not this work's and are used as given. Sixteen retired claims, including two withdrawn from earlier versions of this manuscript, are listed with the measurement that killed each. Files in this deposit: the_offset_belongs_to_the_boundary_v8_submission.pdf — 35 pages, gate output verbatim, script listings supplied separately. the_offset_belongs_to_the_boundary_v8_complete.pdf — 59 pages, identical body with all scripts printed inline. offset_v8_scripts.zip — 23 files. Every number quoted in the paper is printed by one of them; the two gate files reproduce their stored output byte for byte. KEYWORDS entanglement Hamiltonian; entanglement spectrum; modular Hamiltonian; Bisognano-Wichmann; Rice-Mele model; SSH model; free fermions; boundary charge; cut-phase charge; corner transfer matrix; Toeplitz operators; Wiener-Hopf factorisation; Szego-Widom asymptotics; algebraic Heun operator; complete elliptic integrals; entanglement first law; area law; Landau-Widom counting function ADDITIONAL NOTES Supersedes earlier versions of this manuscript. Two claims present in versions 1 to 3 are withdrawn and recorded in the kill list: that the incommensurate offset has no value, and that the offset is one quantum. Both were double-precision truncation of a finite sum. The u^6 coefficient of the shape function reported in the companion results ledger is likewise superseded by the derived value. Computational verification, gating and drafting assistance by an AI collaborator (Claude, Anthropic). Every gate is independently re-runnable from the ancillary scripts.
Strongly simulating a quantum circuit, that is, computing an output amplitude, can be done by summing the circuit's Feynman paths: a weighted count over assignments to Boolean path variables. The circuit's gates induce correlations among these variables, forming a graph whose structure controls several exact simulation routes. This sum-of-powers (SOP) viewpoint underlies recent simulators built on binary decision diagrams and weighted model counting. For a quadratic SOP with nnn variables, even modulus rrr, and a rank-decomposition of its variable graph of width kkk, our dynamic program (DP) computes an amplitude using only O(4kpoly(n))O(4^kpoly(n))O(4kpoly(n)) arithmetic operations. For Clifford+T+T+T circuits, the amplitude is given by an SOP with modulus 888. Rank-width never exceeds linear rank-width, which governs some decision-diagram approaches, and is at most one greater than the Markov--Shi contraction complexity of the circuit tensor network. Moreover, there are non-Clifford families of bounded rank-width where both competing parameters diverge. We also present a stabilizer-rank optimization, exploiting that the DP tables are stabilizer-type Gauss sums. Each subtree runs at the width price of its cut-ranks or at a magic price that discharges the non-Clifford phases below it. The resulting best total cost never exceeds O(4kpoly(n))O(4^kpoly(n))O(4kpoly(n)), yet is polynomial on mixed families where the pure rank-width and pure TTT-count guarantees are both exponential. Clifford amplitudes take polynomial time on any graph, the exact-amplitude consequence of Gottesman--Knill. A prototype evaluation on standard circuit benchmarks finds treewidth bucket elimination the strongest baseline, with the new rank-width DP complementary: it wins on structured families where treewidth blows up.
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.