Fibonacci Anyon Fusion Algebra

The simplest model of universal topological quantum computation.

Section 1

Two Particles, One Rule

In the simplest universal model of quantum computation, there are only two kinds of particle. Everything follows from one fusion rule.

These particles are anyonsQuasiparticles that exist only in 2D systems. Unlike fermions or bosons, swapping two anyons can multiply the quantum state by any phase — or even apply a matrix operation. — quasiparticlesCollective excitations in a material that behave like particles but emerge from many-body interactions — like a wave in a stadium crowd rather than an individual person. that exist only in two-dimensional systems and obey exchange statistics that are neither bosonic nor fermionic. Fibonacci anyons are the simplest anyon model that supports universal quantum computation.

1 Vacuum τ Fibonacci anyon
LabelNameQuantum dimension
1 Vacuum (trivial) d = 1
τ Fibonacci anyon dQuantum dimension — a number measuring how much Hilbert space each particle type contributes. Determines how fast the state space grows as you add particles. = φ = (1+√5)/2 ≈ 1.618
The quantum dimension of τ is the golden ratio φ. This is not a coincidence — it is the deepest fact about this model. The golden ratio enters because the fusion rule τ × τ = 1 + τ forces the quantum dimension to satisfy d2 = 1 + d, whose positive root is φ.

Section 2

The Fusion Rules

Anyon fusion is the quantum analog of adding angular momenta. When two anyons meet, their topological charges combine according to algebraic rules — not resonance, not collision, not interference. Algebra.

Rule 1: 1 × 1 = 1

Vacuum fused with vacuum produces vacuum. The trivial case.

1 1 1 × 1 = 1 1

Rule 2: 1 × τ = τ

Vacuum acts as the identity. Fusing vacuum with τ leaves τ unchanged.

1 τ 1 × τ = τ τ

Rule 3: τ × τ = 1 + τ

This is the rule. Two Fibonacci anyons fuse into a quantum superposition of vacuum and a new Fibonacci anyon. Everything else in this tutorial follows from here.

τ × τ = 1 + τ τ τ 1 vacuum τ anyon superposition

Definition: Fusion

Fusion is deterministic algebra, not probabilistic collision. The ‘+’ in τ × τ = 1 + τ means the outcome space contains both possibilities — the system is in a quantum superposition of having produced vacuum or a new τ anyon. Which outcome you get is determined only when measured.

Section 3

The Fibonacci Connection

When you fuse n Fibonacci anyons sequentially, the number of valid fusion paths follows the Fibonacci sequence. This is not a metaphor — it is a direct algebraic consequence of the fusion rule.

Consider fusing n anyons of type τ left to right. At each step, the intermediate result can be 1 or τ. The fusion rule determines which branches are valid:

Let an = number of paths ending in 1, and bn = number ending in τ. Then:

an+1 = bn    bn+1 = an + bn

This is exactly the Fibonacci recurrence. The total dimension of the fusion space (both charge sectors) is an + bn.

τ1 τ2 1 τ n=2: 2 paths τ3 τ 1 τ n=3: 3 paths τ4 1 τ τ 1 τ n=4: 5 paths Total paths (both charge sectors): 2, 3, 5, 8, 13, 21, 34, ... Fibonacci!
The Fibonacci sequence does not appear here by analogy. The fusion rule τ × τ = 1 + τ generates the recurrence F(n) = F(n−1) + F(n−2) directly. The branching structure of the fusion tree is the Fibonacci recurrence.

Section 4

The Fusion Space

Quantum information in a topological quantum computer is not stored in individual anyons. It is stored in the fusion spaceThe set of all valid fusion outcomes for a collection of anyons. Like a decision tree where each branch is a possible quantum state — the information lives in which branch, not in any single particle. — the space of valid fusion paths through the tree.

Definition: Fusion Space

The fusion space is a Hilbert spaceA mathematical space of quantum states — like a coordinate system for quantum information, where each axis represents a possible measurement outcome. whose basis states are the valid fusion paths. A system of n Fibonacci anyons with fixed total charge has a fusion space of dimension F(n−1) for total charge 1, or F(n) for total charge τ, where F is the Fibonacci sequence (with F(1) = F(2) = 1).

τ τ τ ? ? The information lives in the relationships, not the particles.
No measurement on any single anyon reveals which fusion path the system is on. This is topological non-localityInformation stored in global relationships between particles rather than in any single particle. No local measurement can extract it — like a secret split across multiple servers where no single server holds enough to reconstruct it. — the qubit is encoded in the collective state of all the anyons, inaccessible to any local probe.
Anyons (n)Fusion space dim (total charge τ)Qubits (approx)
321.0
552.3
7133.7
10555.8
20676512.7

The qubit count is log2(dim). The fusion space grows as φn/√5, giving approximately n · log2(φ) ≈ 0.694n qubits for n anyons.

Section 5

Braiding as Computation

When you physically exchange two anyons — moving one around the other in the plane — this applies a unitary transformationA reversible quantum operation that preserves total probability. The quantum equivalent of a rotation — it moves the state around without losing information. to the fusion space. Different exchange sequences produce different quantum gates.

In three dimensions, exchanging two identical particles twice returns the system to its original state. In two dimensions, the second exchange is topologically distinct from the first — the worldlines form a braid, and the braid groupThe mathematical group describing all possible ways to weave strands over and under each other. Unlike simple permutations, braids record the full history of which strand crossed over which. is infinite and non-abelianOperations whose result depends on the order they are performed — doing A then B gives a different result than B then A. This is what makes the system powerful enough for universal computation..

τ1 τ2 τ3 Braid diagram: σ1 (exchange τ1 over τ2) τ1 τ2 τ3 Each braid = a unitary gate on the fusion space

For three Fibonacci anyons with total charge τ, the fusion space is two-dimensional — a single qubit. The braid generators σ1 and σ2 act as 2×2 unitary matrices whose entries involve e4πi/5 and the golden ratio φ.

Theorem (Freedman, Larsen, Wang 2002)1

The image of the braid group representation for Fibonacci anyons is dense in SU(2)The group of all 2×2 unitary matrices with determinant 1. All possible single-qubit quantum gates live in this group — "dense in SU(2)" means braids can approximate any of them.. That is, any single-qubit unitary transformation can be approximated to arbitrary precision by a finite sequence of braids. Combined with the ability to perform entangling gates between qubit pairs, braiding Fibonacci anyons is sufficient for universal quantum computation.

For Fibonacci anyons, braiding alone is sufficient for universal quantum computation. Any quantum algorithm can be compiled into a sequence of anyon exchanges. No additional error correction is needed — the topological nature of the encoding provides it intrinsically.

Section 6

Topological Protection

The central promise of topological quantum computation is fault tolerance by physics3. The quantum gates are determined by the topology of the anyon worldlines — which strands cross over which — not by the precise geometric path taken.

Clean path Same gate Noisy path Same gate =

Continuous deformations of the anyon paths — noise, vibration, imprecise control — do not change the topology. The gate is the same whether the path is smooth or jagged, fast or slow, as long as the same strands cross in the same order.

The only errors that matter are discrete topological errors: an overcrossing mistakenly performed as an undercrossing, or a braid applied to the wrong pair of anyons. These are qualitatively different from the continuous noise that plagues conventional quantum computers.

Topological computation is immune to continuous perturbations. Only discrete topological errors — wrong crossings — can cause mistakes. This is why topological quantum computing is inherently fault-tolerant: the physics provides error correction that conventional approaches must engineer.

Section 7

The Autocatalytic Connection

The Fibonacci anyon fusion algebra satisfies a structural pattern that appears throughout self-sustaining systems — Kauffman's three criteria for autocatalytic closureA self-sustaining set where every element is produced by reactions within the set itself. Like a software system that can rebuild all its own components from source — nothing needs to be imported from outside..

Generation

τ × τ → τ

The system produces its own particle type from fusion. No external factory needed. Self-generating.

Transformation

Braiding transforms states

The fusion space states are transformed by the system's own dynamics — particle exchange. Self-transforming.

Closure

Every product ∈ {1, τ}

Every fusion outcome is already a member of the model. Nothing escapes the algebra. Self-contained.

Structural Identity — with Physical Content

The Fibonacci anyon fusion algebra satisfies Kauffman's three closure criteria for autocatalytic sets. At the algebraic level, this is a structural identity — the same abstract axioms in two mathematical languages (Structural analogy — Anchor 7).

But in FQHE systems, it is more than algebra. Anyonic quasiparticles are collective excitations generated by the substrate (Nayak et al. 2008 — Established, Anchor 2)2. The physical generation of anyons by the 2DEG IS Kauffman's generation criterion, physically instantiated. FQHE systems are already AC bridge demonstrators — the gap is cross-community recognition, not finding a new system.

Section 8

Where to Find Them

Fibonacci anyons are predicted to exist as quasiparticle excitations in certain fractional quantum Hall states — specifically the ν = 12/5 state, as described by the Read–Rezayi model (1999). They have not yet been experimentally confirmed.

This is not a materials problem. The fractional quantum Hall effect occurs in GaAs heterostructures, graphene, ZnO, and Si/SiGe — the substrate does not define the phenomenon. What matters are the conditions: low temperature, strong magnetic field, high-mobility two-dimensional electron gasA thin layer of electrons confined to move in only two dimensions, typically at the interface between two semiconductor materials. The 2D confinement is what allows anyonic excitations to exist.. The same topological order can emerge in any material that provides the right conditions. (Anchor 1: substrate independence.)

Anyons are collective excitations — they are generated by the substrate, not imported into it. The two-dimensional electron system, under the right conditions, spontaneously organizes into a topologically ordered phase whose elementary excitations carry fractional charge and non-abelian braiding statistics. The substrate does not merely host the anyons; it generates them. (Anchor 2: substrate generativity.)

This physical generation is the key to the AC bridge. Section 7 showed that the fusion algebra satisfies Kauffman's autocatalytic closure criteria at the algebraic level. Here in Section 8, we see that the generation criterion is not just algebraic — it is physical. The substrate generates the anyons. The anyons' fusion algebra is self-sustaining. FQHE systems are therefore already demonstrators of the AC bridge: topology and autocatalysis are not two phenomena that need connecting, but one phenomenon described in two scientific languages by communities that have never communicated. The bridge is last in the paper sequence not because the science is hardest, but because the sociology is most hostile.

The search continues. Recent experiments on the ν = 5/2 state (which may host a simpler non-abelian anyon, the Ising anyon) have shown promising signatures. The ν = 12/5 state, where Fibonacci anyons are expected, is more fragile and less studied — but the algebraic structure described in this tutorial is waiting to be found there.

The simplest universal topological quantum computer requires exactly two particle types, one fusion rule, and the golden ratio.
  1. M. H. Freedman, M. Larsen, and Z. Wang, "A modular functor which is universal for quantum computation," Communications in Mathematical Physics 227, 605–622 (2002). ↑
  2. C. Nayak, S. H. Simon, A. Stern, M. Freedman, and S. Das Sarma, "Non-Abelian anyons and topological quantum computation," Reviews of Modern Physics 80, 1083–1159 (2008). ↑
  3. A. Y. Kitaev, "Fault-tolerant quantum computation by anyons," Annals of Physics 303, 2–30 (2003). ↑
← Web Annex