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

A Finite F5 Qupit Layer in TWIST-J: Integer Clifford, Cubic Magic, and Born Minimality

A. M. Thorn

Published May 18, 2026• 0 citations
Publisher

Abstract

A finite, auditable, five-state qupit computation layer derived from the single cyclotomic axiom J = 1 + ζ₅² of the TWIST-J framework. Main results: • Integer Clifford generation over 𝔽₅ for X_a, Z_b, F, P_α, CX, with Weyl phase ω = (J - 1)³ internal to the axiom. • Born minimality lemma forcing F(z) = |z|² from three finite-checkable axioms (phase blindness, Pythagorean additivity, normalization), without invoking Gleason. • Cubic magic boundary M₅ of order 5, lifting to M_{5^r} of order 5^r in the cyclotomic tower ℚ(ζ_{5^r}), with explicit conjugation formula M_{5^r} X_a M_{5^r}⁻¹ = ω_r^(a³) X_a Q_{3a} Z_{3a²}. • Algebraic exact Grover on 𝔽₅^k via phase-matched amplification with algebraic unit phases μ, ν in the algebraic closure of ℚ. The standard unphased Grover iterate is proved never to reach ±|w⟩ exactly on 5^k. • Probabilities in ℚ(√5) by a character-sum probability field lemma; stabilizer outcomes rational. • Eight selectors and witnesses fix p = 5: the Diophantine lock p² + p + 2 = 2^p, the half-ratio identity (p - 2)/(p + 1) = 1/2, the icosahedral coincidence A₅ ≅ PSL(2, 𝔽₅), and a binary-cyclotomic wall convergence 1/ρ₀ = d(d + 1)/2 = 6. Integer-complete on 8-bit registers. State indexing, phase exponents, and 5×5 lookup tables implement every Clifford tableau step. No floating-point state evolution, no asymptotic limit, no fitted dimensionless constant. A companion verification script reproduces every theorem of the paper. Project: https://twistj.com

DOI
10.5281/zenodo.20275290

Related papers

Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs

Tony Newton, Dan-Adrian German

Resource analyses for quantum programs commonly provide safe upper bounds on qubits, gates, or non-Clifford operations. We study a single-qubit dyadic fragment in which the deepest exact resource layer can instead be inferred exactly. Starting from the normalized-midpoint misty-state syntax, we define dyadic program states and the real cyclotomic tower $K_D=\mathbb Q(2\cos(π/2^D))$. For the projective single-qubit Clifford-cyclotomic tower $\widehat G_D\subseteq SO(3)$, we prove the relative intersection law $\widehat G_D\cap SO(3,K_d)=\widehat G_d$ for $d\le D$. Combining this descent theorem with an arithmetic-closure invariant for adaptive stabilizer processing yields $\mathrm{Fdepth}(U)=\mathrm{Adepth}(U)=\mathrm{Rdepth}(U)$: the smallest real cyclotomic field containing the Bloch matrix of an exactly synthesizable channel, the shallowest dyadic gate alphabet realizing it up to global phase, and the shallowest dyadic program-state layer sufficient for exact stabilizer-assisted implementation coincide. At that common minimum, known fixed-alphabet synthesis gives minimum primitive-rotation count. We package the result as an exact static resource effect and outline a certificate-producing compiler.

arXiv:2611.06909•Nov 4, 2026•0 citations

FodaOS Unified Field Theory Series III: Algebraic Quantum Mechanics and Combinatorial Finite-Field Exactification — GF(p) Framework (p=F₄=65537)

Pan JinWen

This paper studies the integer matrix representation of the Clifford+T quantum gate set over the finite field GF(65537) of the Fermat prime F₄=65537. The cyclotomic splitting theorem 65537≡1(mod 8) guarantees the complete splitting of 8th roots of unity, so that the algebraic relations of the H/S/T gates (H²=I, S⁴=I, T⁸=I) hold exactly modulo 65537. On this basis: (1) Quantum circuits (state vectors / Bell entanglement / QFT₈ / error-correcting codes / Deutsch algorithm / teleportation / dense coding) are simulated over GF(65537) without floating-point truncation, revealing the zero-norm phenomenon that (1,i) has zero norm in GF(p), which requires a GF(p²) field extension to repair the quadratic form — the finite field does not satisfy the positive-definiteness axiom of the inner product on complex Hilbert space, and this framework is a discrete simulation tool rather than a replacement for standard quantum mechanics; (2) The unitary matrices of Shor/Grover/HHL quantum algorithms are represented as integer matrices over GF(65537), enabling floating-point-error-free circuit simulation on classical machines — this is classical exact simulation and does not enjoy quantum speedup; (3) Exact solutions of the cyclic Ramsey numbers R_circ(5,5)=42 and R_circ(3,10)=39 (exhaustive computation within the cyclic-graph subclass), with the Paley construction reducing edge coloring to a quadratic-residue criterion over GF(p); (4) The formal algebraic duality between NTT and QFT; (5) The three-fold rationale of finite-field exactification — the finiteness principle eliminates dependence on infinite structures, the algebraic-integerization theorem guarantees closed operations, and the finite-field origin principle clarifies that the original working domains of core mathematical structures such as the Hasse theorem, Weil conjectures, Riemann-Roch theorem, BSD conjecture, and Chevalley-Warning theorem are inherently finite fields; the adoption of GF(65537) is a return to the source rather than a discrete approximation. Unifying theme: the number-theoretic symmetry of the Fermat prime F₄=65537 provides a floating-point-error-free integer arithmetic foundation for both quantum circuit simulation and combinatorial graph exhaustive search, and many core theorems are natively rooted in finite fields.

•Aug 22, 2026•0 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

Deterministic Quantum State Tomography of Photonic Qubits with Digital Light Sources and Digital Fractal Prism Etalon Without Error Propagation

Carol-Xavier Cortès

Four World Premieres Founded on Six Postulates and Five Derived Propositions This publication releases twenty self-contained tables as a permanently valid geometrical-tabular reference corpus. They stand in the tradition of classical trigonometric tables: directly readable, independently constructible and transferable from one generation to the next. The primary invention is a geometrical-tabular trigonometry. Its relations are held in exact form and can be read, constructed and verified on paper. The ISO C17 and CUDA executions attest to the computational reproducibility of this primary construction. The mathematical core consists of six foundational postulates and five propositions derived from them. The Six Postulates I — Square Space. Ratios are held and carried in their exact geometrical form: d² = 2. The square is the carrier of the relation. Rational ratios remain fractions, and roots remain geometrical constructions. The tables thereby preserve the mathematical relation itself. II — Ω as Fixed Point. The Ω fixed point is explicitly set: Ω = 0. The two poles remain separate: −1, 0, +1. Zero forms the central position between Withhold and Assign. It carries the closure and enables the return between the separate poles. III — Chirality as a Law of the Corpus. The table corpus possesses a globally right-rotating reading direction. QuPits+ forms a local counter-reading within this right-rotating body. The corpus thereby carries both reading directions while preserving its global chirality. IV — Modulo 12. The modulus is set as m = 12. Within this modulus, the factorial order collapses from n ≥ 4 onward: (n!)ⁿ ≡ 0 mod 12. The power of two remains active at the same time. For k ≥ 2, the periodic sequence is 2ᵏ mod 12 = 4, 8, 4, 8, … Modulo 12 therefore carries two simultaneously readable orders: factorial collapse and continuing binary periodicity. V — The Four Registers. For every dimension n, four registers are set: Body = 16ⁿ, Centre = +1, Initial Stage = 17ⁿ − 16ⁿ, Flow = 17ⁿ − 1. These four definitions form the algebraic carrier of the dimension-independent collapse identity. VI — Complement Involution K16. The colour complement is set as an involution: Inv(R, G, B) = (255 − R, 255 − G, 255 − B). Applying it twice returns the initial value: Inv² = id. The complement forms the second half of the Lumina carrier. The prism return recognises and closes the original colour state. The Five Derived Propositions Proposition I — Dimension-Independent Collapse Identity. From the four registers of Postulate V, it follows for every n that (16ⁿ + 1) + (17ⁿ − 16ⁿ) − (17ⁿ − 1) − 1 − 1 = 0. The complete reduction is 16ⁿ + 1 + 17ⁿ − 16ⁿ − 17ⁿ + 1 − 1 − 1 = 0. The 16ⁿ terms cancel exactly. The 17ⁿ terms cancel exactly. The remaining units close to zero: +1 + 1 − 1 − 1 = 0. Therefore: For every n: (16ⁿ + 1) + (17ⁿ − 16ⁿ) − (17ⁿ − 1) − 1 − 1 = 0. This collapse is independent of dimension. It is an algebraic identity that stands complete on a single line. Table X sets the registers for every n; the 4D table prints the instance n = 4: 65,537 + 17,985 − 83,520 − 1 − 1 = 0. The identity is the strongest proposition in the table corpus. Proposition II — Threefold Pole Balance. For the three ordered pairs (0, 1), (1, 1), (1, 0), the difference of squares a² − b² produces the three register values −1, 0, +1. Their sum closes exactly: (−1) + 0 + (+1) = 0. The same signature appears in the Tomography Binding Register: sₓ(ρ_A) + sₓ(½I) + sₓ(ρ_D) = −1 + 0 + 1 = 0. The geometrical pole balance and the tomographic Σ-signature are therefore two readings of the same register closure. Proposition III — Invariant 16- and 8-Carriers. For k ∈ {−1, 0, +1}, the following hold: 16(16 + k) − 16k = 256 and 8(16 + k) − 8k = 128. Substituting the respective pole value leaves the result unchanged. The k-contributions cancel within the expression. The carrier values 256 = 16² and 128 = 8 · 16 therefore remain invariant across all three register positions. Proposition IV — Persistence of the Power of Two Modulo 12. For every power of two: 2ᵏ ≢ 0 mod 12. The reason is elementary: 3 ∤ 2ᵏ. From k = 2 onward, the remainders alternate: 4, 8, 4, 8, … The power of two passes periodically through modulo 12 while always retaining a non-zero register value. Proposition V — Geometrical Bridge Between Square and Tetrahedron. The defined square relations lead to t² = d² = 2. The tetrahedral edge therefore has the same squared length as the face diagonal of the unit square or cube face. This equality forms an exact constructional bridge between the 60° object and the 45° object. Both geometrical bodies retain their separate registers; their common relation is carried by the held square 2. The Four World Premieres 1. Permanently Valid Geometrical-Tabular Trigonometry. The twenty tables form an autonomous mathematical reference corpus. Their relations are preserved as squares, rational ratios, modular registers and geometrical constructions. The tables carry their validity within their own reading and proof structure. 2. Dimension-Independent Register Closure. The four registers Body, Centre, Initial Stage and Flow produce the same exact collapse identity for every n: (16ⁿ + 1) + (17ⁿ − 16ⁿ) − (17ⁿ − 1) − 1 − 1 = 0. The dimension changes the size of the registers while the closure remains invariant. 3. Exact Rational Binding of Qubit Tomography. The Ω-CUBITO Tomography Binding Register connects the H, V, D and R+ projectors to a rational forward and inverse map. The off-axis 25-Gate etalon s = (3/5, 4/5, 0) closes its physical admissibility through 3² + 4² = 5². The three pole etalons simultaneously realise the Ω-Σ-signature −1 + 0 + 1 = 0 within the tomographic density-matrix representation. 4. Error-Isolated Reconstruction of Independent Layers. Each layer arises directly from shared immutable inputs. Each possesses its own starting point, computational route and closure. Geometrical identities close geometrically. Modular registers close within their defined modulus. Tomographic etalons close through their exact return map. Cryptographic witnesses close through bit-exact reproduction. The ISO C17 and CUDA executions confirm this structure as reproducible execution witnesses. The specified heap-free critical paths document the stable technical execution of the geometrical-tabular reference corpus. Scientific Status The tomography registers in this publication carry exact deterministic etalon data. They verify the forward map, inverse reconstruction, physical admissibility and complete return to the defined density matrix. Calibrated detector counts and their acquisition metadata form the experimental input layer. Their insertion applies the Binding Register directly to photonic quantum-state tomography. The tables carry their own burden of proof. Carol-Xavier Cortès · ORCID: 0009-0000-1861-5503 · DOI: 10.5281/zenodo.21221870 · First digital edition, 2026

•Jul 13, 2026•0 citations

Active Stabilizers In Reed–Muller CSS Codes From Cayley–Dickson Zero-Divisors

Giovanni Levratti

We establish three results connecting the zero-divisor structure of the Cayley–Dickson algebras Aₙ to the stabilizer formalism of quantum error-correcting codes. Step 1 (Bijection, n=4). The 7 lo-flats of ZD(4) — weight-4 subsets {a,b,c,d} ⊂ {1,...,7} with a⊕b⊕c⊕d=0 — are in explicit bijection with the 7 non-identity elements of the X-stabilizer group of the Steane [[7,1,3]] code. All 7 lo-flats carry identical sign-parity pattern: π(EE|FF)=−1 (inactive), π(EF₁)=π(EF₂)=+1 (active). Step 2 (Operator translation). For every mixed flat F={i,j,8+k,8+l} in A₄, the algebraic identity π_A·π_B·π_C=−1 translates into the Clifford-group identity (Z_αZ_β)(X_αX_γ)(X_βX_γ) = −Y_αY_β. The global phase −1 is the precise Clifford avatar of π_Aπ_Bπ_C=−1. The operator −Y_αY_β is a detectable error with full-group syndrome weight 2^(n−2), proved for all n≥4 and verified on QPU. Step 3 (Extension to n=5, verified on QPU). The 15 Fano planes of PG(3,F₂) are in explicit bijection with the 15 non-identity elements of the X-stabilizer group S_X ≅ (Z/2Z)⁴ of the [[15,7,3]] code (4 generators, 2⁴−1=15 non-identity elements). The phase identity and syndrome formula extend to all n≥4 (Universal Phase Lemma). Syndrome structure verified on ibm_kingston (156-qubit QPU, job d8bm67ijki0s73aq6idg, 27 May 2026). The Type-A/Type-B criterion for Fano planes in PG(3,F₂) is resolved: a plane W is Type-B if and only if 8∈W or W={1,...,7}, where 8=(1,0,0,0)∈F₂⁴ is the bridge element between A₃ and A₄ in the Cayley–Dickson tower. All algebraic results are cited from the companion papers (doi:10.5281/zenodo.20315751, doi:10.5281/zenodo.20417859).Every claim is labelled [VERIFIED], [THEOREM], or [OPEN] throughout.

•May 28, 2026•0 citations

The Pythagorean Angle Lattice in Quantum Mechanics: Exact Spin Rotations, Gate Synthesis Obstructions and Arithmetic No-Go Theorems for Quantum Computation

Chetansing K. Rajput

The Pythagorean Angle Lattice produces exact spinor-norm and continuity no-go theorems for single-qubit gate synthesis, free and dense groups of difference gates, and exponent walls at positive distance from the Clifford group. Let θ be the smaller acute angle of a primitive Pythagorean triangle (a, b, c) and z = e^{iθ} = (b + ia)/c. The rational norm-one phases form the Pythagorean angle lattice P ⊂ ℚ(i). We study the exact arithmetic of the associated single-qubit rotations and of the difference angle Δ = π/2 − 2θ, whose spin rotation is U_n(Δ) = (A I − i B n · σ)/(√2 c) with A = a + b, B = b − a. Within the sector of rational rotation matrices, Gaussian rational eigenphases occur exactly for rational Bloch axes, and the obstruction to an exact rational spin lift is the spinor squareclass, which on these phases is the halving class [N(1 + z)]. Every Pythagorean difference gate has spinor norm [2] and factors exactly as a quarter-turn times the rational spin gate defined by the triple. This gives a spinor-norm obstruction to exact synthesis with forced length parity, an obstruction to synthesising the rotation by θ from difference and Clifford gates unless c is a perfect square, and an exact criterion for rational fourth roots; difference gates about orthogonal axes generate a free group, and about non-parallel axes a dense group with approximating words of logarithmic length. For pairs of gates we prove exact commutator identities, including a relation between the commutator scalar and the Born overlap of PAL-internal axis states; nested commutators obey an exact logistic recurrence for their transverse intensity, with a transition at θ = π/12 and a 2-adic filtration of their spectral discriminants. In odd prime-power dimensions, suitable Weil operators admit exponent intertwiners U ↦ U^{−2} at projective distance at least 1/(2√2) and diamond distance at least √(1 − p^{−k}) from the Clifford group, with Weyl spreading at least 1/360. Finally, density of the dyadic classes gives a continuity obstruction: without an a priori height bound, no fixed finite-copy continuous protocol separates them with a uniform margin. All results concern exact arithmetic structures inside ordinary quantum mechanics; no modification of its postulates is proposed.

•Oct 10, 2026•0 citations
A finite, auditable, five-state qupit computation layer derived from the single cyclotomic axiom J = 1 + ζ₅² of the TWIST-J framework. Main results: • Integer Clifford generation over 𝔽₅ for X_a, Z_b, F, P_α, CX, with Weyl phase ω = (J - 1)³ internal to the axiom. • Born minimality lemma forcing F(z) = |z|² from three finite-checkable axioms (phase blindness, Pythagorean additivity, normalization), without invoking Gleason. • Cubic magic boundary M₅ of order 5, lifting to M_{5^r} of order 5^r in the cyclotomic tower ℚ(ζ_{5^r}), with explicit conjugation formula M_{5^r} X_a M_{5^r}⁻¹ = ω_r^(a³) X_a Q_{3a} Z_{3a²}. • Algebraic exact Grover on 𝔽₅^k via phase-matched amplification with algebraic unit phases μ, ν in the algebraic closure of ℚ. The standard unphased Grover iterate is proved never to reach ±|w⟩ exactly on 5^k. • Probabilities in ℚ(√5) by a character-sum probability field lemma; stabilizer outcomes rational. • Eight selectors and witnesses fix p = 5: the Diophantine lock p² + p + 2 = 2^p, the half-ratio identity (p - 2)/(p + 1) = 1/2, the icosahedral coincidence A₅ ≅ PSL(2, 𝔽₅), and a binary-cyclotomic wall convergence 1/ρ₀ = d(d + 1)/2 = 6. Integer-complete on 8-bit registers. State indexing, phase exponents, and 5×5 lookup tables implement every Clifford tableau step. No floating-point state evolution, no asymptotic limit, no fitted dimensionless constant. A companion verification script reproduces every theorem of the paper. Project: https://twistj.com
Resource analyses for quantum programs commonly provide safe upper bounds on qubits, gates, or non-Clifford operations. We study a single-qubit dyadic fragment in which the deepest exact resource layer can instead be inferred exactly. Starting from the normalized-midpoint misty-state syntax, we define dyadic program states and the real cyclotomic tower KD=Q(2cos⁡(π/2D))K_D=\mathbb Q(2\cos(π/2^D))KD​=Q(2cos(π/2D)). For the projective single-qubit Clifford-cyclotomic tower G^D⊆SO(3)\widehat G_D\subseteq SO(3)GD​⊆SO(3), we prove the relative intersection law G^D∩SO(3,Kd)=G^d\widehat G_D\cap SO(3,K_d)=\widehat G_dGD​∩SO(3,Kd​)=Gd​ for d≤Dd\le Dd≤D. Combining this descent theorem with an arithmetic-closure invariant for adaptive stabilizer processing yields Fdepth(U)=Adepth(U)=Rdepth(U)\mathrm{Fdepth}(U)=\mathrm{Adepth}(U)=\mathrm{Rdepth}(U)Fdepth(U)=Adepth(U)=Rdepth(U): the smallest real cyclotomic field containing the Bloch matrix of an exactly synthesizable channel, the shallowest dyadic gate alphabet realizing it up to global phase, and the shallowest dyadic program-state layer sufficient for exact stabilizer-assisted implementation coincide. At that common minimum, known fixed-alphabet synthesis gives minimum primitive-rotation count. We package the result as an exact static resource effect and outline a certificate-producing compiler.
This paper studies the integer matrix representation of the Clifford+T quantum gate set over the finite field GF(65537) of the Fermat prime F₄=65537. The cyclotomic splitting theorem 65537≡1(mod 8) guarantees the complete splitting of 8th roots of unity, so that the algebraic relations of the H/S/T gates (H²=I, S⁴=I, T⁸=I) hold exactly modulo 65537. On this basis: (1) Quantum circuits (state vectors / Bell entanglement / QFT₈ / error-correcting codes / Deutsch algorithm / teleportation / dense coding) are simulated over GF(65537) without floating-point truncation, revealing the zero-norm phenomenon that (1,i) has zero norm in GF(p), which requires a GF(p²) field extension to repair the quadratic form — the finite field does not satisfy the positive-definiteness axiom of the inner product on complex Hilbert space, and this framework is a discrete simulation tool rather than a replacement for standard quantum mechanics; (2) The unitary matrices of Shor/Grover/HHL quantum algorithms are represented as integer matrices over GF(65537), enabling floating-point-error-free circuit simulation on classical machines — this is classical exact simulation and does not enjoy quantum speedup; (3) Exact solutions of the cyclic Ramsey numbers R_circ(5,5)=42 and R_circ(3,10)=39 (exhaustive computation within the cyclic-graph subclass), with the Paley construction reducing edge coloring to a quadratic-residue criterion over GF(p); (4) The formal algebraic duality between NTT and QFT; (5) The three-fold rationale of finite-field exactification — the finiteness principle eliminates dependence on infinite structures, the algebraic-integerization theorem guarantees closed operations, and the finite-field origin principle clarifies that the original working domains of core mathematical structures such as the Hasse theorem, Weil conjectures, Riemann-Roch theorem, BSD conjecture, and Chevalley-Warning theorem are inherently finite fields; the adoption of GF(65537) is a return to the source rather than a discrete approximation. Unifying theme: the number-theoretic symmetry of the Fermat prime F₄=65537 provides a floating-point-error-free integer arithmetic foundation for both quantum circuit simulation and combinatorial graph exhaustive search, and many core theorems are natively rooted in finite fields.
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.
Four World Premieres Founded on Six Postulates and Five Derived Propositions This publication releases twenty self-contained tables as a permanently valid geometrical-tabular reference corpus. They stand in the tradition of classical trigonometric tables: directly readable, independently constructible and transferable from one generation to the next. The primary invention is a geometrical-tabular trigonometry. Its relations are held in exact form and can be read, constructed and verified on paper. The ISO C17 and CUDA executions attest to the computational reproducibility of this primary construction. The mathematical core consists of six foundational postulates and five propositions derived from them. The Six Postulates I — Square Space. Ratios are held and carried in their exact geometrical form: d² = 2. The square is the carrier of the relation. Rational ratios remain fractions, and roots remain geometrical constructions. The tables thereby preserve the mathematical relation itself. II — Ω as Fixed Point. The Ω fixed point is explicitly set: Ω = 0. The two poles remain separate: −1, 0, +1. Zero forms the central position between Withhold and Assign. It carries the closure and enables the return between the separate poles. III — Chirality as a Law of the Corpus. The table corpus possesses a globally right-rotating reading direction. QuPits+ forms a local counter-reading within this right-rotating body. The corpus thereby carries both reading directions while preserving its global chirality. IV — Modulo 12. The modulus is set as m = 12. Within this modulus, the factorial order collapses from n ≥ 4 onward: (n!)ⁿ ≡ 0 mod 12. The power of two remains active at the same time. For k ≥ 2, the periodic sequence is 2ᵏ mod 12 = 4, 8, 4, 8, … Modulo 12 therefore carries two simultaneously readable orders: factorial collapse and continuing binary periodicity. V — The Four Registers. For every dimension n, four registers are set: Body = 16ⁿ, Centre = +1, Initial Stage = 17ⁿ − 16ⁿ, Flow = 17ⁿ − 1. These four definitions form the algebraic carrier of the dimension-independent collapse identity. VI — Complement Involution K16. The colour complement is set as an involution: Inv(R, G, B) = (255 − R, 255 − G, 255 − B). Applying it twice returns the initial value: Inv² = id. The complement forms the second half of the Lumina carrier. The prism return recognises and closes the original colour state. The Five Derived Propositions Proposition I — Dimension-Independent Collapse Identity. From the four registers of Postulate V, it follows for every n that (16ⁿ + 1) + (17ⁿ − 16ⁿ) − (17ⁿ − 1) − 1 − 1 = 0. The complete reduction is 16ⁿ + 1 + 17ⁿ − 16ⁿ − 17ⁿ + 1 − 1 − 1 = 0. The 16ⁿ terms cancel exactly. The 17ⁿ terms cancel exactly. The remaining units close to zero: +1 + 1 − 1 − 1 = 0. Therefore: For every n: (16ⁿ + 1) + (17ⁿ − 16ⁿ) − (17ⁿ − 1) − 1 − 1 = 0. This collapse is independent of dimension. It is an algebraic identity that stands complete on a single line. Table X sets the registers for every n; the 4D table prints the instance n = 4: 65,537 + 17,985 − 83,520 − 1 − 1 = 0. The identity is the strongest proposition in the table corpus. Proposition II — Threefold Pole Balance. For the three ordered pairs (0, 1), (1, 1), (1, 0), the difference of squares a² − b² produces the three register values −1, 0, +1. Their sum closes exactly: (−1) + 0 + (+1) = 0. The same signature appears in the Tomography Binding Register: sₓ(ρ_A) + sₓ(½I) + sₓ(ρ_D) = −1 + 0 + 1 = 0. The geometrical pole balance and the tomographic Σ-signature are therefore two readings of the same register closure. Proposition III — Invariant 16- and 8-Carriers. For k ∈ {−1, 0, +1}, the following hold: 16(16 + k) − 16k = 256 and 8(16 + k) − 8k = 128. Substituting the respective pole value leaves the result unchanged. The k-contributions cancel within the expression. The carrier values 256 = 16² and 128 = 8 · 16 therefore remain invariant across all three register positions. Proposition IV — Persistence of the Power of Two Modulo 12. For every power of two: 2ᵏ ≢ 0 mod 12. The reason is elementary: 3 ∤ 2ᵏ. From k = 2 onward, the remainders alternate: 4, 8, 4, 8, … The power of two passes periodically through modulo 12 while always retaining a non-zero register value. Proposition V — Geometrical Bridge Between Square and Tetrahedron. The defined square relations lead to t² = d² = 2. The tetrahedral edge therefore has the same squared length as the face diagonal of the unit square or cube face. This equality forms an exact constructional bridge between the 60° object and the 45° object. Both geometrical bodies retain their separate registers; their common relation is carried by the held square 2. The Four World Premieres 1. Permanently Valid Geometrical-Tabular Trigonometry. The twenty tables form an autonomous mathematical reference corpus. Their relations are preserved as squares, rational ratios, modular registers and geometrical constructions. The tables carry their validity within their own reading and proof structure. 2. Dimension-Independent Register Closure. The four registers Body, Centre, Initial Stage and Flow produce the same exact collapse identity for every n: (16ⁿ + 1) + (17ⁿ − 16ⁿ) − (17ⁿ − 1) − 1 − 1 = 0. The dimension changes the size of the registers while the closure remains invariant. 3. Exact Rational Binding of Qubit Tomography. The Ω-CUBITO Tomography Binding Register connects the H, V, D and R+ projectors to a rational forward and inverse map. The off-axis 25-Gate etalon s = (3/5, 4/5, 0) closes its physical admissibility through 3² + 4² = 5². The three pole etalons simultaneously realise the Ω-Σ-signature −1 + 0 + 1 = 0 within the tomographic density-matrix representation. 4. Error-Isolated Reconstruction of Independent Layers. Each layer arises directly from shared immutable inputs. Each possesses its own starting point, computational route and closure. Geometrical identities close geometrically. Modular registers close within their defined modulus. Tomographic etalons close through their exact return map. Cryptographic witnesses close through bit-exact reproduction. The ISO C17 and CUDA executions confirm this structure as reproducible execution witnesses. The specified heap-free critical paths document the stable technical execution of the geometrical-tabular reference corpus. Scientific Status The tomography registers in this publication carry exact deterministic etalon data. They verify the forward map, inverse reconstruction, physical admissibility and complete return to the defined density matrix. Calibrated detector counts and their acquisition metadata form the experimental input layer. Their insertion applies the Binding Register directly to photonic quantum-state tomography. The tables carry their own burden of proof. Carol-Xavier Cortès · ORCID: 0009-0000-1861-5503 · DOI: 10.5281/zenodo.21221870 · First digital edition, 2026
We establish three results connecting the zero-divisor structure of the Cayley–Dickson algebras Aₙ to the stabilizer formalism of quantum error-correcting codes. Step 1 (Bijection, n=4). The 7 lo-flats of ZD(4) — weight-4 subsets {a,b,c,d} ⊂ {1,...,7} with a⊕b⊕c⊕d=0 — are in explicit bijection with the 7 non-identity elements of the X-stabilizer group of the Steane [[7,1,3]] code. All 7 lo-flats carry identical sign-parity pattern: π(EE|FF)=−1 (inactive), π(EF₁)=π(EF₂)=+1 (active). Step 2 (Operator translation). For every mixed flat F={i,j,8+k,8+l} in A₄, the algebraic identity π_A·π_B·π_C=−1 translates into the Clifford-group identity (Z_αZ_β)(X_αX_γ)(X_βX_γ) = −Y_αY_β. The global phase −1 is the precise Clifford avatar of π_Aπ_Bπ_C=−1. The operator −Y_αY_β is a detectable error with full-group syndrome weight 2^(n−2), proved for all n≥4 and verified on QPU. Step 3 (Extension to n=5, verified on QPU). The 15 Fano planes of PG(3,F₂) are in explicit bijection with the 15 non-identity elements of the X-stabilizer group S_X ≅ (Z/2Z)⁴ of the [[15,7,3]] code (4 generators, 2⁴−1=15 non-identity elements). The phase identity and syndrome formula extend to all n≥4 (Universal Phase Lemma). Syndrome structure verified on ibm_kingston (156-qubit QPU, job d8bm67ijki0s73aq6idg, 27 May 2026). The Type-A/Type-B criterion for Fano planes in PG(3,F₂) is resolved: a plane W is Type-B if and only if 8∈W or W={1,...,7}, where 8=(1,0,0,0)∈F₂⁴ is the bridge element between A₃ and A₄ in the Cayley–Dickson tower. All algebraic results are cited from the companion papers (doi:10.5281/zenodo.20315751, doi:10.5281/zenodo.20417859).Every claim is labelled [VERIFIED], [THEOREM], or [OPEN] throughout.
The Pythagorean Angle Lattice produces exact spinor-norm and continuity no-go theorems for single-qubit gate synthesis, free and dense groups of difference gates, and exponent walls at positive distance from the Clifford group. Let θ be the smaller acute angle of a primitive Pythagorean triangle (a, b, c) and z = e^{iθ} = (b + ia)/c. The rational norm-one phases form the Pythagorean angle lattice P ⊂ ℚ(i). We study the exact arithmetic of the associated single-qubit rotations and of the difference angle Δ = π/2 − 2θ, whose spin rotation is U_n(Δ) = (A I − i B n · σ)/(√2 c) with A = a + b, B = b − a. Within the sector of rational rotation matrices, Gaussian rational eigenphases occur exactly for rational Bloch axes, and the obstruction to an exact rational spin lift is the spinor squareclass, which on these phases is the halving class [N(1 + z)]. Every Pythagorean difference gate has spinor norm [2] and factors exactly as a quarter-turn times the rational spin gate defined by the triple. This gives a spinor-norm obstruction to exact synthesis with forced length parity, an obstruction to synthesising the rotation by θ from difference and Clifford gates unless c is a perfect square, and an exact criterion for rational fourth roots; difference gates about orthogonal axes generate a free group, and about non-parallel axes a dense group with approximating words of logarithmic length. For pairs of gates we prove exact commutator identities, including a relation between the commutator scalar and the Born overlap of PAL-internal axis states; nested commutators obey an exact logistic recurrence for their transverse intensity, with a transition at θ = π/12 and a 2-adic filtration of their spectral discriminants. In odd prime-power dimensions, suitable Weil operators admit exponent intertwiners U ↦ U^{−2} at projective distance at least 1/(2√2) and diamond distance at least √(1 − p^{−k}) from the Clifford group, with Weyl spreading at least 1/360. Finally, density of the dyadic classes gives a continuity obstruction: without an a priori height bound, no fixed finite-copy continuous protocol separates them with a uniform margin. All results concern exact arithmetic structures inside ordinary quantum mechanics; no modification of its postulates is proposed.