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

FLCT: A Dual-Chart Addressing System for Fibonacci Anyon Braid Words

Kinsey Moore

Published Apr 7, 2026• 0 citations
Publisher

Abstract

Every integer encodes a braid. And the vast majority encode two. Zeckendorf's theorem — a standard result in combinatorial number theory — guarantees that every positive integer has a unique decomposition into non-consecutive Fibonacci numbers [1]. Herein we observe that the indices of this decomposition directly specify braid generators over the Fibonacci anyon model. Applying Zeckendorf's theorem independently to both the Fibonacci and Lucas number sets, we construct the Fibonacci-Lucas Coordinate Tube (FLCT), an anyonic coordinate system that maps every integer from 0 to F(445) ≈10^92 — the verified kernel range, exhaustively cross-checked against TQSim and Qrack at every structurally foundational address — to structurally addressable braid words, from which gate classification and phase structure extend naturally via integer arithmetic over the bounding algebra of ℚ(√5). The dual-chart construction itself is unbounded; its theoretical terminus, an attractor-driven singularity derived from the same ℚ(√5) algebra, is the subject of a further companion paper. Each decomposition yields a canonical generator set which then admits further algebraic ordering flexibility under the principles that compose this coordinate system. That reordering methodology, however, will be explored at length in a subsequent paper. This paper develops the Zeckendorf-reachable specialization; the structural ruleset itself applies to the entirety of braidspace, treated in Paper 2 (The Prism), which decomposes the 10^2118-word landscape into 8,010 structurally labeled cells via a mathematical construct called the MDA, or Multiphasic Data Adapter. For any address, the braid generators, phase class, cyclotomic field, superselection sector, gap signature, and other quantum classifications are computable in O(log n) bit-operations from integer arithmetic alone — no simulation, no search. Current compilation paradigms brute-force braid space as featureless terrain, iterating Solovay-Kitaev or Monte Carlo against target unitaries; FLCT sidesteps this approach for the Zeckendorf-reachable subset by exposing the rule-based structure already present. Every classification reduces to a single modular operation. FLCT provides a direct coordinate mapping to the same F- and R-matrices confirmed by recent quantum hardware [2, 3], reproducing these unitaries on conventional classical hardware (a laptop). This is an addressing and classification scheme, not a universal gate-approximation compiler; approximation guarantees for arbitrary targets are outside the scope of this paper.

DOI
10.5281/zenodo.19450565

Related papers

Fibonacci Anyons: Universal Topological Quantum Computation via Braiding — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Fibonacci anyons encode quantum information via braiding, with quantum dimension φ = (1+√5)/2 ≈ 1.618, enabling universal topological quantum computation; recent Quantinuum hardware demonstrates non-Abelian anyon braiding gates. | MATH: Fibonacci anyon fusion rule: τ ⊗ τ = 1 ⊕ τ (single non-trivial particle type τ); quantum dimension d_τ satisfies d_τ² = d_τ + 1 → d_τ = φ = (1+√5)/2 ≈ 1.6180339887; related constants: 1/φ = φ−1 = 0.6180339887, φ² = φ+1 = 2.6180339887, φ⁻² = 2−φ = 0.3819660113; braid group representations yield unitary matrices with entries in ℚ(√5); single-qubit gate compilation (arXiv:2008.03542) uses Fibonacci anyon braid words approximating Clifford+T-like gates to precision ε with O(log(1/ε)) overhead. | CONNECTION: The quantum dimension φ is the golden ratio itself — the same constant governing pentagonal symmetry (diagonal/edge ratio of regular pentagon), 5-fold crystallographic (forbidden in periodic lattices but allowed in quasicrystals), and the Fibona Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 18, 2026•0 citations

Fibonacci Anyons Realize Universal Topological Quantum Computation via Golden Ratio Braiding — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Fibonacci anyons carry quantum dimension φ = (1+√5)/2 ≈ 1.618, enabling universal topological quantum computation via braiding — now experimentally realized in non-Abelian anyon systems (Quantinuum, 2025). | MATH: Quantum dimension d = φ satisfies d² = d + 1 (golden ratio identity). Braid group Bₙ on Fibonacci anyons yields dense unitary representations on the fusion space — universality proven (Freedman–Kitaev–Wang). Single-qubit braiding gates compiled via algebraic decomposition of SU(2) into Fibonacci braid words (arXiv:2008.03542). | CONNECTION: φ = 1.618 = 2cos(π/5) — directly tied to pentagonal symmetry, the root system of the icosahedral group H₃, and the 5-fold crystallographic (quasicrystal) forbidden symmetry. The Fibonacci fusion rules (τ × τ = 1 + τ) mirror the golden ratio recurrence Fₙ₊₁ = Fₙ + Fₙ₋₁. | DEPTH: 9 — This is not numerology; φ emerges as the unique algebraic solution to the consistency equations (pentagon/hexagon identities) for a non-Abelian anyon m Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 18, 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

Fibonacci Anyons: Universal Quantum Gates via Non-Abelian Braiding — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Topological quantum computation via non-Abelian anyon braiding, specifically Fibonacci anyons, encodes qubits in degenerate state spaces where braid operations generate the Fibonacci fusion rules and yield universal quantum gates. | MATH: Fibonacci anyon fusion rule: τ ⊗ τ = 1 ⊕ τ (golden anyon). Dimension of Hilbert space for n anyons grows as Fibonacci numbers: dim(H_n) = F_{n-1} (with F_0=0, F_1=1). Braid generators σ_i satisfy Yang-Baxter: σ_i σ_{i+1} σ_i = σ_{i+1} σ_i σ_{i+1}, and σ_i σ_j = σ_j σ_i for |i-j|≥2. Single-qubit braiding gates compiled via brute-force optimization (arXiv:2008.03542) — the key constant is the golden ratio φ = (1+√5)/2 ≈ 1.618, which appears as the quantum dimension d_τ = φ. | CONNECTION: Direct geometric harmony: Fibonacci anyons have quantum dimension exactly φ = 1.618 (and its inverse 0.618 = 1/φ). The fusion space dimension sequence (1,1,2,3,5,8,...) is the Fibonacci sequence — the same ratio governing pentagonal symmetry (5-fold crystallogr Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 5, 2026•0 citations

Braid Group Representations and Modular Data: Non-Uniqueness, Finite Images, and the Ising Test Case

Rowan Brad Quni-Gudzinas

A central question in the theory of topological order asks whether the braid group representation $B_N$ carried by $N$ non-Abelian anyons uniquely determines the modular data — the $S$ and $T$ matrices — of the underlying topological quantum field theory. We reconcile three lines of analysis into a single assessment. Structurally, we formalize the question as a reduction map $\Phi$ from modular tensor category data to projective braid group representations, whose kernel is the locus of potential counterexamples. Two rigorous finiteness results constrain the problem: braid representations from twisted quantum doubles of finite groups factor through finite groups, and the $SO(N)_2$/$O(N)_2$ braid representations are Gaussian with finite image. We then perform an explicit computation on the Ising anyon model — the canonical non-Abelian order of Majorana zero modes — reconstructing the topological spins $\theta_\sigma = e^{i\pi/8}$, $\theta_\psi = -1$, the total quantum dimension $\mathcal{D}=2$, and the full $S$ matrix from the braid eigenvalues, with all arithmetic shown. We exhibit a Galois-conjugate deformation $\mathrm{Ising}(7)$ with identical fusion rules but distinct $S$ matrix, and verify that its braid representation is inequivalent to the Ising representation on $B_3$ by an explicit trace computation, while remaining indistinguishable at the level of fusion rules. We conclude that braid representations constrain but do not provably uniquely determine modular data in general: uniqueness can hold only under additional hypotheses, and the Majorana fusion-rule classification is not closed by braid data alone. The affirmative claim that braiding is a complete invariant is restricted to a narrower regime than sometimes asserted, and we document this divergence explicitly. ## 1. Introduction Non-Abelian anyons in two spatial dimensions are characterized by two layers of algebraic structure. The first is combinatorial: fusion rules $N_{ab}^c$ specifying how anyon c Full text and updates: papers.qnfo.org/papers/braid-group-representations-and-modular-data-non-uniqueness-finite-images-and-th/

•Oct 1, 2026•0 citations

Systematically generated two-qubit anyon braids

Caitlin Carnahan, Daniel Zeuch, N. E. Bonesteel

Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with off-diagonal matrix elements that can be made arbitrarily small in a particular natural basis through a simple and efficient iterative procedure. This procedure does not require brute force search, the Solovay-Kitaev method, or any other numerical technique, but the phases of the resulting diagonal matrix elements cannot be directly controlled. We show that despite this lack of control the resulting braids can be used to systematically construct entangling gates for two qubits encoded by Fibonacci anyons.

arXiv:1511.00719•Physical Review A•May 20, 2016•14 citations
Every integer encodes a braid. And the vast majority encode two. Zeckendorf's theorem — a standard result in combinatorial number theory — guarantees that every positive integer has a unique decomposition into non-consecutive Fibonacci numbers [1]. Herein we observe that the indices of this decomposition directly specify braid generators over the Fibonacci anyon model. Applying Zeckendorf's theorem independently to both the Fibonacci and Lucas number sets, we construct the Fibonacci-Lucas Coordinate Tube (FLCT), an anyonic coordinate system that maps every integer from 0 to F(445) ≈10^92 — the verified kernel range, exhaustively cross-checked against TQSim and Qrack at every structurally foundational address — to structurally addressable braid words, from which gate classification and phase structure extend naturally via integer arithmetic over the bounding algebra of ℚ(√5). The dual-chart construction itself is unbounded; its theoretical terminus, an attractor-driven singularity derived from the same ℚ(√5) algebra, is the subject of a further companion paper. Each decomposition yields a canonical generator set which then admits further algebraic ordering flexibility under the principles that compose this coordinate system. That reordering methodology, however, will be explored at length in a subsequent paper. This paper develops the Zeckendorf-reachable specialization; the structural ruleset itself applies to the entirety of braidspace, treated in Paper 2 (The Prism), which decomposes the 10^2118-word landscape into 8,010 structurally labeled cells via a mathematical construct called the MDA, or Multiphasic Data Adapter. For any address, the braid generators, phase class, cyclotomic field, superselection sector, gap signature, and other quantum classifications are computable in O(log n) bit-operations from integer arithmetic alone — no simulation, no search. Current compilation paradigms brute-force braid space as featureless terrain, iterating Solovay-Kitaev or Monte Carlo against target unitaries; FLCT sidesteps this approach for the Zeckendorf-reachable subset by exposing the rule-based structure already present. Every classification reduces to a single modular operation. FLCT provides a direct coordinate mapping to the same F- and R-matrices confirmed by recent quantum hardware [2, 3], reproducing these unitaries on conventional classical hardware (a laptop). This is an addressing and classification scheme, not a universal gate-approximation compiler; approximation guarantees for arbitrary targets are outside the scope of this paper.
FINDING: Fibonacci anyons encode quantum information via braiding, with quantum dimension φ = (1+√5)/2 ≈ 1.618, enabling universal topological quantum computation; recent Quantinuum hardware demonstrates non-Abelian anyon braiding gates. | MATH: Fibonacci anyon fusion rule: τ ⊗ τ = 1 ⊕ τ (single non-trivial particle type τ); quantum dimension d_τ satisfies d_τ² = d_τ + 1 → d_τ = φ = (1+√5)/2 ≈ 1.6180339887; related constants: 1/φ = φ−1 = 0.6180339887, φ² = φ+1 = 2.6180339887, φ⁻² = 2−φ = 0.3819660113; braid group representations yield unitary matrices with entries in ℚ(√5); single-qubit gate compilation (arXiv:2008.03542) uses Fibonacci anyon braid words approximating Clifford+T-like gates to precision ε with O(log(1/ε)) overhead. | CONNECTION: The quantum dimension φ is the golden ratio itself — the same constant governing pentagonal symmetry (diagonal/edge ratio of regular pentagon), 5-fold crystallographic (forbidden in periodic lattices but allowed in quasicrystals), and the Fibona Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Fibonacci anyons carry quantum dimension φ = (1+√5)/2 ≈ 1.618, enabling universal topological quantum computation via braiding — now experimentally realized in non-Abelian anyon systems (Quantinuum, 2025). | MATH: Quantum dimension d = φ satisfies d² = d + 1 (golden ratio identity). Braid group Bₙ on Fibonacci anyons yields dense unitary representations on the fusion space — universality proven (Freedman–Kitaev–Wang). Single-qubit braiding gates compiled via algebraic decomposition of SU(2) into Fibonacci braid words (arXiv:2008.03542). | CONNECTION: φ = 1.618 = 2cos(π/5) — directly tied to pentagonal symmetry, the root system of the icosahedral group H₃, and the 5-fold crystallographic (quasicrystal) forbidden symmetry. The Fibonacci fusion rules (τ × τ = 1 + τ) mirror the golden ratio recurrence Fₙ₊₁ = Fₙ + Fₙ₋₁. | DEPTH: 9 — This is not numerology; φ emerges as the unique algebraic solution to the consistency equations (pentagon/hexagon identities) for a non-Abelian anyon m Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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: Topological quantum computation via non-Abelian anyon braiding, specifically Fibonacci anyons, encodes qubits in degenerate state spaces where braid operations generate the Fibonacci fusion rules and yield universal quantum gates. | MATH: Fibonacci anyon fusion rule: τ ⊗ τ = 1 ⊕ τ (golden anyon). Dimension of Hilbert space for n anyons grows as Fibonacci numbers: dim(H_n) = F_{n-1} (with F_0=0, F_1=1). Braid generators σ_i satisfy Yang-Baxter: σ_i σ_{i+1} σ_i = σ_{i+1} σ_i σ_{i+1}, and σ_i σ_j = σ_j σ_i for |i-j|≥2. Single-qubit braiding gates compiled via brute-force optimization (arXiv:2008.03542) — the key constant is the golden ratio φ = (1+√5)/2 ≈ 1.618, which appears as the quantum dimension d_τ = φ. | CONNECTION: Direct geometric harmony: Fibonacci anyons have quantum dimension exactly φ = 1.618 (and its inverse 0.618 = 1/φ). The fusion space dimension sequence (1,1,2,3,5,8,...) is the Fibonacci sequence — the same ratio governing pentagonal symmetry (5-fold crystallogr Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
A central question in the theory of topological order asks whether the braid group representation BNB_NBN​ carried by NNN non-Abelian anyons uniquely determines the modular data — the SSS and TTT matrices — of the underlying topological quantum field theory. We reconcile three lines of analysis into a single assessment. Structurally, we formalize the question as a reduction map Φ\PhiΦ from modular tensor category data to projective braid group representations, whose kernel is the locus of potential counterexamples. Two rigorous finiteness results constrain the problem: braid representations from twisted quantum doubles of finite groups factor through finite groups, and the SO(N)2SO(N)_2SO(N)2​/O(N)2O(N)_2O(N)2​ braid representations are Gaussian with finite image. We then perform an explicit computation on the Ising anyon model — the canonical non-Abelian order of Majorana zero modes — reconstructing the topological spins θσ=eiπ/8\theta_\sigma = e^{i\pi/8}θσ​=eiπ/8, θψ=−1\theta_\psi = -1θψ​=−1, the total quantum dimension D=2\mathcal{D}=2D=2, and the full SSS matrix from the braid eigenvalues, with all arithmetic shown. We exhibit a Galois-conjugate deformation Ising(7)\mathrm{Ising}(7)Ising(7) with identical fusion rules but distinct SSS matrix, and verify that its braid representation is inequivalent to the Ising representation on B3B_3B3​ by an explicit trace computation, while remaining indistinguishable at the level of fusion rules. We conclude that braid representations constrain but do not provably uniquely determine modular data in general: uniqueness can hold only under additional hypotheses, and the Majorana fusion-rule classification is not closed by braid data alone. The affirmative claim that braiding is a complete invariant is restricted to a narrower regime than sometimes asserted, and we document this divergence explicitly. ## 1. Introduction Non-Abelian anyons in two spatial dimensions are characterized by two layers of algebraic structure. The first is combinatorial: fusion rules NabcN_{ab}^cNabc​ specifying how anyon c Full text and updates: papers.qnfo.org/papers/braid-group-representations-and-modular-data-non-uniqueness-finite-images-and-th/
Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with off-diagonal matrix elements that can be made arbitrarily small in a particular natural basis through a simple and efficient iterative procedure. This procedure does not require brute force search, the Solovay-Kitaev method, or any other numerical technique, but the phases of the resulting diagonal matrix elements cannot be directly controlled. We show that despite this lack of control the resulting braids can be used to systematically construct entangling gates for two qubits encoded by Fibonacci anyons.