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 Anyon Amplitude Is an Algebraic Integer: Exact, Cross-Validated, Kernel-Checked Topological Quantum Computation

Richard Goodman, The Institute for Applied Ontological Mathematics

Published Jul 12, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.11464.48648

Related papers

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

Anyons and Topological Quantum Computation

Tudor D. Stanescu

CRC Press eBooks•Dec 13, 2016•1 citation

Measurement-only topological quantum computation via anyonic interferometry

Parsa Bonderson, Michael Hartley Freedman, Chetan Nayak

arXiv:0808.1933•Annals of Physics•Oct 30, 2008•99 citations

Non-Abelian Anyon Braiding Enables Topological Quantum Computation — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Non-Abelian anyon fusion algebra exhibits self-similarity under braid group representations, enabling topological quantum computation via braiding operations. MATH: - Braid group \( B_n \) generators \( \sigma_i \) satisfy \( \sigma_i \sigma_{i+1} \sigma_i = \sigma_{i+1} \sigma_i \sigma_{i+1} \) and \( \sigma_i \sigma_j = \sigma_j \sigma_i \) for \( |i-j|>1 \). - Hecke algebra relations: \( (\sigma_i - q^{1/2})(\sigma_i + q^{-1/2}) = 0 \), with \( q = e^{2\pi i/k} \) for SU(2)_k anyons. - Fusion rules: \( \phi_a \times \phi_b = \sum_c N_{ab}^c \phi_c \), where \( N_{ab}^c \) are non-negative integers (fusion coefficients). - Fibonacci anyon fusion: \( \tau \times \tau = 1 + \tau \), with quantum dimension \( d_\tau = \phi = (1+\sqrt{5})/2 \approx 1.618 \). CONNECTION: - Fibonacci anyon quantum dimension \( d_\tau = \phi = 1.618 \) (golden ratio). - Braid matrix eigenvalues for Fibonacci anyons: \( e^{\pm 3\pi i/5} \), related to golden ratio via \( 2\cos(3\pi/5) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 21, 2026•0 citations

Self-Similar Anyon Fusion Algebras Enable Topological Quantum Gates — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Non-Abelian anyon fusion algebras exhibit self-similarity under braid group representations, enabling topological quantum computation via braiding operations that encode quantum gates. MATH: Fusion algebra for anyon types a, b, c: \( a \times b = \sum_c N_{ab}^c c \), where \( N_{ab}^c \) are non-negative integers (fusion coefficients). Braid group \( B_n \) generators \( \sigma_i \) satisfy \( \sigma_i \sigma_{i+1} \sigma_i = \sigma_{i+1} \sigma_i \sigma_{i+1} \) (Yang-Baxter equation). For Fibonacci anyons: fusion rule \( \tau \times \tau = 1 + \tau \), with quantum dimension \( d_\tau = \phi = (1+\sqrt{5})/2 \approx 1.618 \). Braid matrices yield \( R \)-matrix eigenvalues: \( e^{\pm i\pi/5} \), \( e^{\pm i3\pi/5} \). CONNECTION: Fibonacci anyon quantum dimension \( d_\tau = \phi = 1.618 \) (golden ratio). Fusion matrix eigenvalues involve \( \phi^{-1} = 0.618 \). Braid group representations correspond to \( SU(2)_3 \) Chern-Simons theory, linked to \( E_8 \) root system Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 21, 2026•0 citations

Quantum bivariate bicycle codes with weight-8 checks surpassing the BB benchmark

Liangdong Lu, Ruipan Yang, Guanmin Guo

Bivariate bicycle (BB) codes of Bravyi \emph{et al.}~\cite{Bravyi2024} are quantum low-density parity-check codes with weight-$6$ checks, exemplified by $[[144,12,12]]$ with $kd^2/n=12$. We develop the algebraic structure theory of BB-type codes with weight-$8$ checks (weight-$4$ generator polynomials) and use it, together with an exactly validated search pipeline, to construct and certify new codes. We prove an exact dimension formula $k=2\dim R/(A,B)$ (forcing even $k$), a $4\ell m$-element symmetry group on generator pairs, an $X/Z$ distance equality $d_X=d_Z$, and a family of subgroup-coset kernel vectors giving rigorous distance upper bounds and a design rule for high-distance constructions; all distances are computed exhaustively by a cross-validated bit-mask verifier. At $n=144$ the pipeline returns a census of $53$ codes whose strongest members surpass the BB benchmark: $[[144,6,d\ge 15]]$ exceeds the benchmark distance $12$ (certified $d\ge 15$), $[[144,10,12]]$ reaches it with weight-$8$ checks, and $[[144,16,10]]$ encodes a third more logical qubits at $kd^2/n=11.11$ ($7.4\%$ below benchmark) while decoding no worse. At $n=72$, $[[72,14,8]]$ attains $kd^2/n=12.44$---more than twice the same-length BB code---and decodes better; a circuit-level memory experiment places our weight-$8$ codes at $\approx 0.1\%$ pseudo-threshold versus $\approx 0.4\%$ for the BB reference under an identical model, quantifying the threshold cost of the heavier checks. All structural statements are verified numerically on the whole census.

quant-pharXiv:2609.06572•Sep 8, 2026•4 citations
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.
FINDING: Non-Abelian anyon fusion algebra exhibits self-similarity under braid group representations, enabling topological quantum computation via braiding operations. MATH: - Braid group Bn B_n Bn​ generators σi \sigma_i σi​ satisfy σiσi+1σi=σi+1σiσi+1 \sigma_i \sigma_{i+1} \sigma_i = \sigma_{i+1} \sigma_i \sigma_{i+1} σi​σi+1​σi​=σi+1​σi​σi+1​ and σiσj=σjσi \sigma_i \sigma_j = \sigma_j \sigma_i σi​σj​=σj​σi​ for ∣i−j∣>1 |i-j|>1 ∣i−j∣>1. - Hecke algebra relations: (σi−q1/2)(σi+q−1/2)=0 (\sigma_i - q^{1/2})(\sigma_i + q^{-1/2}) = 0 (σi​−q1/2)(σi​+q−1/2)=0, with q=e2πi/k q = e^{2\pi i/k} q=e2πi/k for SU(2)_k anyons. - Fusion rules: ϕa×ϕb=∑cNabcϕc \phi_a \times \phi_b = \sum_c N_{ab}^c \phi_c ϕa​×ϕb​=∑c​Nabc​ϕc​, where Nabc N_{ab}^c Nabc​ are non-negative integers (fusion coefficients). - Fibonacci anyon fusion: τ×τ=1+τ \tau \times \tau = 1 + \tau τ×τ=1+τ, with quantum dimension dτ=ϕ=(1+5)/2≈1.618 d_\tau = \phi = (1+\sqrt{5})/2 \approx 1.618 dτ​=ϕ=(1+5​)/2≈1.618. CONNECTION: - Fibonacci anyon quantum dimension dτ=ϕ=1.618 d_\tau = \phi = 1.618 dτ​=ϕ=1.618 (golden ratio). - Braid matrix eigenvalues for Fibonacci anyons: e±3πi/5 e^{\pm 3\pi i/5} e±3πi/5, related to golden ratio via \( 2\cos(3\pi/5) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Non-Abelian anyon fusion algebras exhibit self-similarity under braid group representations, enabling topological quantum computation via braiding operations that encode quantum gates. MATH: Fusion algebra for anyon types a, b, c: a×b=∑cNabcc a \times b = \sum_c N_{ab}^c c a×b=∑c​Nabc​c, where Nabc N_{ab}^c Nabc​ are non-negative integers (fusion coefficients). Braid group Bn B_n Bn​ generators σi \sigma_i σi​ satisfy σiσi+1σi=σi+1σiσi+1 \sigma_i \sigma_{i+1} \sigma_i = \sigma_{i+1} \sigma_i \sigma_{i+1} σi​σi+1​σi​=σi+1​σi​σi+1​ (Yang-Baxter equation). For Fibonacci anyons: fusion rule τ×τ=1+τ \tau \times \tau = 1 + \tau τ×τ=1+τ, with quantum dimension dτ=ϕ=(1+5)/2≈1.618 d_\tau = \phi = (1+\sqrt{5})/2 \approx 1.618 dτ​=ϕ=(1+5​)/2≈1.618. Braid matrices yield R R R-matrix eigenvalues: e±iπ/5 e^{\pm i\pi/5} e±iπ/5, e±i3π/5 e^{\pm i3\pi/5} e±i3π/5. CONNECTION: Fibonacci anyon quantum dimension dτ=ϕ=1.618 d_\tau = \phi = 1.618 dτ​=ϕ=1.618 (golden ratio). Fusion matrix eigenvalues involve ϕ−1=0.618 \phi^{-1} = 0.618 ϕ−1=0.618. Braid group representations correspond to SU(2)3 SU(2)_3 SU(2)3​ Chern-Simons theory, linked to E8 E_8 E8​ root system Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Bivariate bicycle (BB) codes of Bravyi \emph{et al.}~\cite{Bravyi2024} are quantum low-density parity-check codes with weight-666 checks, exemplified by [[144,12,12]][[144,12,12]][[144,12,12]] with kd2/n=12kd^2/n=12kd2/n=12. We develop the algebraic structure theory of BB-type codes with weight-888 checks (weight-444 generator polynomials) and use it, together with an exactly validated search pipeline, to construct and certify new codes. We prove an exact dimension formula k=2dim⁡R/(A,B)k=2\dim R/(A,B)k=2dimR/(A,B) (forcing even kkk), a 4ℓm4\ell m4ℓm-element symmetry group on generator pairs, an X/ZX/ZX/Z distance equality dX=dZd_X=d_ZdX​=dZ​, and a family of subgroup-coset kernel vectors giving rigorous distance upper bounds and a design rule for high-distance constructions; all distances are computed exhaustively by a cross-validated bit-mask verifier. At n=144n=144n=144 the pipeline returns a census of 535353 codes whose strongest members surpass the BB benchmark: [[144,6,d≥15]][[144,6,d\ge 15]][[144,6,d≥15]] exceeds the benchmark distance 121212 (certified d≥15d\ge 15d≥15), [[144,10,12]][[144,10,12]][[144,10,12]] reaches it with weight-888 checks, and [[144,16,10]][[144,16,10]][[144,16,10]] encodes a third more logical qubits at kd2/n=11.11kd^2/n=11.11kd2/n=11.11 (7.4%7.4\%7.4% below benchmark) while decoding no worse. At n=72n=72n=72, [[72,14,8]][[72,14,8]][[72,14,8]] attains kd2/n=12.44kd^2/n=12.44kd2/n=12.44---more than twice the same-length BB code---and decodes better; a circuit-level memory experiment places our weight-888 codes at ≈0.1%\approx 0.1\%≈0.1% pseudo-threshold versus ≈0.4%\approx 0.4\%≈0.4% for the BB reference under an identical model, quantifying the threshold cost of the heavier checks. All structural statements are verified numerically on the whole census.