Fibonacci and Ising Anyons
A non-Abelian anyon theory is a piece of bookkeeping so rigid that it doubles as a quantum computer. Specify a finite set of charges, the fusion rules saying which charges combine into which, and the associativity () and braiding () data that make exchange a consistent unitary action on the degenerate fusion space — and the theory is complete. Two such theories dominate every course and lab proposal because they are the two simplest with a single self-fusing non-Abelian charge: the Fibonacci and Ising models. They sit at opposite ends of one axis, computational power, and between them draw the sharpest line topology has to offer. The Fibonacci model is the minimal universal theory. Its one nontrivial charge obeys , its fusion spaces have Fibonacci-number dimensions, and the Freedman–Larsen–Wang theorem proves braiding alone generates a dense subgroup of the unitaries on each. By Solovay–Kitaev any gate is then a braid word of length polylogarithmic in the target accuracy — full quantum computation from nothing but moving particles around one another. The Ising model is the canonical non-universal theory. Its charges are the anyon content of the Majorana / superconductor and the Moore–Read state, and braiding anyons produces exactly the Clifford gates — genuinely non-Abelian, exponentially protected, yet by Gottesman–Knill classically simulable. The organizing lesson: universality belongs to the modular tensor category, not to non-Abelian statistics as such, and Ising's one missing ingredient — a non-Clifford magic gate — connects topology to the whole fault-tolerant gate-synthesis program.
- Fibonacci anyons have a single nontrivial charge with ; braiding them is dense in on each fusion space, so braids alone are universal for quantum computation.
- Ising anyons have charges with , , ; their braids generate only the Clifford group, which Gottesman–Knill makes classically simulable — non-universal.
- Both theories are fixed by their -matrices (fusion associativity) and -matrices (braiding phases), constrained by the pentagon and hexagon equations up to gauge.
- Quantum dimensions read off the fusion rules: , ; total quantum dimensions and .
- Ising's missing gate is supplied by magic-state distillation, restoring universality while the Clifford part stays topologically protected; Ising arises from Majorana modes and the state, Fibonacci is sought in .
- Key idea: an anyon theory's computational power is decided by whether its braid-group image in is dense (Fibonacci ⇒ universal) or finite (Ising ⇒ Clifford-only); the and data satisfying the pentagon and hexagon equations are all you need to compute either.
An anyon theory's computational power is fixed by whether the braid-group image in is dense (Fibonacci ⇒ universal) or finite (Ising ⇒ Clifford-only); the and matrices satisfying the pentagon and hexagon equations are all you need to compute either.
Where this lives today
Both theories have moved from blackboard toward cryostat, at different speeds. Ising-type statistics are the largest hardware bet: Microsoft's topological-qubit program encodes qubits in Majorana zero modes at the ends of proximitized nanowires, and its 2023–2025 devices (the "topological gap protocol" and the Majorana 1 processor) braid Ising excitations for protected Clifford gates, with distillation planned to close the universality gap. In fractional quantum Hall systems, interferometry has shown anyonic braiding directly (Nakamura et al., 2020), and the plateau — home of Ising anyons — is probed by thermal-Hall measurements. Fibonacci anyons are the harder prize: none has been produced, the leading candidate is fragile and contested, and proposals to engineer Fibonacci statistics from coupled Majorana or parafermion arrays are an active frontier. The framing open problem is stark: every demonstrated non-Abelian platform is Ising (Clifford-only) type, so the first Fibonacci anyon would be the first intrinsically universal topological medium ever observed.
The physical picture
Picture an anyon model as a self-consistent accounting system for fusion. Bring two anyons together and ask their total charge; the fusion rules list the allowed answers, and when a pair can fuse more than one way, the which-way label is a quantum degree of freedom no local measurement can read. Stack many anyons and the number of consistent fusion histories is the dimension of a protected Hilbert space — protected because the information lives in the global fusion pattern, not any one particle. For Fibonacci, fusing copies of to charge gives dimension the -th Fibonacci number, growing like : the quantum dimension is the degeneracy-growth rate per anyon, the golden ratio solving .
Braiding is then a unitary rotating within this protected space, and the decisive question is geometric. Think of each exchange as a rotation of a sphere: do the available rotations fill the whole rotation group densely, or close into a finite, crystalline set of points? Fibonacci's two generators are incommensurate rotations about tilted axes — their closure is dense, and dense means universal. Ising's braids are rigidly the rotations and phase gates that snap shut into the 24-element Clifford group — finite, and finite means simulable. The same braid that gives Ising its noise protection also caps its power; the second figure sets the two Bloch spheres side by side.
Neither model is an exotic curiosity. They are the two simplest members of the family: is the Ising-like non-universal theory, is Fibonacci, and the Freedman–Larsen–Wang theorem shows every except is universal — simplicity and universality coinciding almost exactly, which is why so much of the field is written in the language of these two examples.
The core equations
The starting point of any anyon model is its fusion rules — the multiplication table saying which total charges two anyons may carry. For Fibonacci there is one nontrivial charge, and the entire theory grows from a single self-fusing rule.
where: — the unique nontrivial anyon charge; — the vacuum charge (fusion identity); — direct sum of distinct fusion channels, here multiplicity-free. Reading it: two 's fuse either to vacuum or back to , and which outcome occurs stores a qubit of protected information. Ising has three charges but the same shape: one non-Abelian that self-fuses two ways, plus an Abelian fermion .
where: — the non-Abelian anyon (Majorana / Ising spin field), ; — an Abelian fermion, , its own antiparticle; — vacuum. Reading it: has two channels so is non-Abelian; has one outcome so is Abelian. The number controlling how fast the Hilbert space grows is the quantum dimension, and it is not free: it is the largest eigenvalue of the fusion matrix , read off the fusion rule.
where: — the matrix counting fusion channels; — quantum dimension (Perron–Frobenius eigenvalue); . Reading it: is the fusion rule (1) with charges replaced by dimensions — why the golden ratio is baked into Fibonacci from the start. Associativity of fusion is not automatic — reassociating three anyons requires a basis change between fusion trees, the -matrix, which for three 's of total charge is a orthogonal matrix fixed (up to gauge) by the pentagon equation.
where: — change of basis between the left-associated tree and the right-associated on the space of three 's with total charge ; , . Reading it: real, symmetric, and squaring to the identity, it is its own inverse — the fact used to build the second braid generator below. Braiding — exchanging two anyons — is diagonal in the fusion channel, one phase per channel; these are the -matrices, differing decisively between the two theories.
where: the first entry is the phase for the pair fusing to vacuum, the second for the nontrivial channel ( for Fibonacci, for Ising). Reading it: the ratio of the Ising phases is , an -gate relative phase, whereas the Fibonacci ratio never closes into a finite group. Finally, how big is the protected space? For Fibonacci it follows the Fibonacci numbers; for Ising it doubles every two anyons — one encoded qubit per added pair.
where: — space of -anyons at fixed total charge; — the -th Fibonacci number; for Ising, 's encode qubits, so four 's give one qubit. Reading it: the Fibonacci dimension is not a power of two — the fingerprint of a genuinely non-Abelian, universal medium.
The goal is to show that the Fibonacci -matrix of equation (4) is not an assumption but a consequence: once you demand that the two ways of reassociating a chain of anyons agree, the pentagon equation together with unitarity forces every entry, and the golden ratio drops out as the only consistent value. We work on the two-dimensional space of three 's of total charge and impose the constraints until the matrix is fixed up to a gauge choice.
Step 1. Label the two basis states of three 's (total charge ) by the intermediate charge of the first pair. The -move rewrites the same state in the other pairing, a linear map on this two-dimensional space; unitarity forces unitary, and a standard gauge makes it real and symmetric. Why: only the intermediate charge is physical, so recoupling is a rotation among these two labels.
Step 2. Impose the pentagon equation — the two distinct sequences of -moves relating the five pairings of four 's must give the same unitary. For Fibonacci this collapses to scalar relations in the entries, the key one being . Why: the pentagon is the associativity axiom, the algebraic content of "reassociation is unambiguous".
Step 3. Combine with unitarity , giving and . With the pentagon relation becomes , so (using ) and . Why: the golden ratio is forced — the unique solution consistent with both pentagon and unitarity, mirroring .
Step 4. Assemble: , and squaring gives since the diagonal is and the off-diagonal cancels. Why: is its own inverse — exactly the property that lets us conjugate one braid generator into a second, independent one below.
Go deeper · Derivation B · 2 minWhy Fibonacci braiding is universal
The goal is to show that the two elementary braids on three -anyons generate a dense subgroup of , so finite braid words approximate any single-qubit gate to arbitrary accuracy, and then that a braid across two such triples supplies the entangler completing universality for . We encode the qubit in three 's of total charge (two-dimensional since ), with basis labelled by the intermediate charge or .
Step 1. The first generator braids anyons 1 and 2, diagonal in this basis: , a -axis Bloch rotation by the phase difference . Why: braiding the first pair acts directly on the intermediate charge, so the gate is simply the -matrix.
Step 2. The second generator braids anyons 2 and 3, so we change to the other fusion tree with , braid, and change back: (using ). Since rotates by an angle with cosine , is a rotation about a tilted axis. Why: recoupling tilts the axis, turning one diagonal gate into two rotations about non-parallel axes — the raw material for generating everything.
Step 3. Two rotations about distinct axes generate a dense subgroup of unless the group is finite; here the angles are rational multiples of but the axis-separation has irrational cosine, so the group is infinite and, being non-solvable in a compact simple group, dense — the Freedman–Larsen–Wang theorem for . Why: density is exactly "reach any gate arbitrarily closely" — single-qubit universality by braids.
Step 4. Efficiency follows from Solovay–Kitaev: any target gate is reached to accuracy by a braid word of length , (and in improved variants). Why: density guarantees existence; Solovay–Kitaev upgrades it to efficient compilation, overhead only polylogarithmic.
Step 5. Complete universality: braiding an anyon of one triple around one of another produces a two-qubit controlled-rotation. Dense single-qubit gates plus one entangler is universal, so Fibonacci braiding computes any polynomial-time quantum algorithm. Why: arbitrary local unitaries plus one entangler generate all of densely.
Go deeper · Derivation C · 1 minWhy Ising braiding gives only Clifford gates
The goal is to compute the gates -braids produce, identify the generated group as the Clifford group, and invoke Gottesman–Knill to conclude that Ising braiding — despite being genuinely non-Abelian — cannot be universal, then show which ingredient repairs it. We encode one qubit in four anyons of total charge , basis the fusion channel ( or ) of the first pair — two-dimensional, since .
Step 1. Braiding the two anyons inside a pair multiplies the channels by and ; the ratio is , so up to global phase the gate is . Why: only the relative phase is physical, and here it is exactly the of the gate.
Step 2. Braiding across the two pairs is the -conjugated exchange , and with this is (up to phase) the Hadamard . Why: the Ising recoupling matrix is literally Hadamard, so the tilted braid is the second Clifford generator.
Step 3. The group generated by is the 24-element single-qubit Clifford group — the octahedral rotation group of the Bloch sphere, finite and not dense, so single-qubit universality already fails. Why: and have orders 4 and 2 and close after 24 elements; no braid escapes the octahedron.
Step 4. Braiding between two four- qubits gives an entangler equivalent to up to Clifford, so the braid group maps onto — the full Clifford group. By Gottesman–Knill, Clifford circuits on stabilizer inputs are classically simulable in polynomial time. Why: a classically simulable gate set cannot be universal, so Ising braiding alone is provably weak.
Step 5. Restore universality by injecting a non-Clifford resource: the magic state gate-teleports using only Clifford operations and measurement, and distilling noisy copies into clean ones promotes the protected Clifford set to a universal one. Why: is universal, so the one missing rotation — paid for non-topologically — closes the gap.
Limiting cases
A handful of invariants cleanly separate the two theories, each computable directly from the fusion rules and braid data.
| Case | Result | Meaning |
|---|---|---|
| Fibonacci quantum dimension | solves , the fusion rule ; degeneracy grows as | |
| Ising quantum dimensions | from ; 's span a -dimensional space | |
| Total quantum dimension | Fibonacci ; Ising | |
| Topological spins | marks as a fermion; Ising carries chiral central charge | |
| Braid-group image | (Fib); (Ising) | dense ⇒ universal (Solovay–Kitaev); finite ⇒ Clifford, simulable (Gottesman–Knill) |
| placement | (Fib), (Ising) | universal for all except ; the two simplest points bracket the family |
Worked examples
1 · The topological qubit and its exponential growth (confidence builder)
How many qubits can Fibonacci -anyons store, and at what rate does that capacity grow per anyon? Take the total charge fixed to , so the protected dimension is .
Step 1. Smallest case: for , equation (6) gives — one qubit, its basis labelled by whether the first two 's fused to or . This is the elementary Fibonacci qubit of every braiding-gate construction. Three τ-anyons encode exactly one qubit.
Step 2. Scale up: for , , so the qubit count is — twenty anyons hold more than twelve qubits, and the count is not a power of two, the signature of a non-Abelian medium.
Step 3. Growth rate: by Binet's formula , successive dimensions ratio to , so each anyon multiplies the space by — a capacity of qubits per anyon. Check: versus , agreeing to . The space grows by φ ≈ 1.618 — about 0.694 qubits — per anyon.
2 · An Ising σ-braid is the S gate
Encode a qubit in the fusion channel of a pair and compute the single-qubit gate produced by one elementary exchange. Then say precisely what is still missing for universality.
Step 1. The two channels acquire the braid phases of equation (5): the vacuum channel gets and the channel gets . Only the relative phase is physical, so factor out the global . The braid is .
Step 2. Evaluate the relative phase: . The gate is therefore up to global phase — the Clifford phase gate, satisfying . One in-pair σ-braid realizes the S gate exactly.
Step 3. The inter-pair braid () gives Hadamard, so generates the 24-element Clifford group and an inter-qubit braid adds a -equivalent entangler. No braid ever produces , the rotation — the square root of that braids cannot reach. The missing gate is , supplied by magic-state distillation.
Physics of the portrait
The claim at the centre of this article — that some anyons compute anything and others almost nothing — is a theorem, due to Michael Freedman with Michael Larsen and Zhenghan Wang.
Origins · 1 minMichael Freedman and how this was discovered
Michael Freedman won the Fields Medal in 1986 for proving the four-dimensional Poincaré conjecture, using geometric topology far from physics. In the late 1990s he made an audacious bet: that the fault tolerance a quantum computer needs could come not from active error correction but from the topology of anyon worldlines — an idea developed alongside Alexei Kitaev's 1997 proposal of fault-tolerant computation by anyons. Its technical heart is the theorem he proved in 2000–2002 with Larsen and Wang: the braid-group representations of the Chern–Simons theories are dense in the projective unitary groups for every level except — exactly why Fibonacci () is universal while Ising () is not. The two models here are the boundary stones of that theorem: Ising, the largest non-universal example, tied by Moore and Read to the state and by Kitaev to Majorana modes; and Fibonacci, the smallest universal one, still hunted in . A Fields-medal topologist's density theorem now setting the design target for quantum hardware is one of the cleaner cases of pure mathematics dictating engineering.
Going further
Texts. Preskill, Lecture Notes on Quantum Computation, ch. 9 · Nielsen & Chuang, Quantum Computation and Quantum Information, ch. 10 · Pachos, Introduction to Topological Quantum Computation (Cambridge, 2012) · Wang, Topological Quantum Computation (AMS, 2010) · Kitaev, Anyons in an exactly solved model and beyond, Ann. Phys. 321 (2006) 2.
Provenance. A verifier should confirm: (1) satisfies and the Fibonacci -matrix squares to the identity via ; (2) and , ; (3) the Ising ratio giving an gate, with the Clifford group (Gottesman–Knill); (4) the FLW density result for and Solovay–Kitaev scaling . Spins , , and , are standard. Cross-check against Preskill ch. 9, Nayak et al. Rev. Mod. Phys. 80 (2008) 1083, Kitaev Ann. Phys. 321 (2006), and Freedman–Larsen–Wang, Commun. Math. Phys. 227 (2002) 605.
Prerequisites. Anyons and Fractional Statistics · Non-Abelian Braiding and Fusion Rules · Topological Quantum Computation. Leads to. Magic State Distillation · Majorana Zero Modes · The Cost of Magic and the Resource Theory of Magic.
Ask the tutor: Ask me to braid three Fibonacci anyons into a gate, or trace a Majorana pair through the Ising -braid to watch a Clifford gate appear.
What does "quantum dimension" actually count?
The quantum dimension is the rate at which the protected space grows per added anyon of type : stack of them and it grows like . For Fibonacci , so each multiplies the space by the golden ratio; for Ising , so two 's double it. Formally is the largest eigenvalue of the fusion matrix, which is why becomes . A non-integer is the unmistakable mark of a non-Abelian theory — the many-anyon space is not a tensor product of local qubits.
If Ising anyons only give Clifford gates, why build Ising hardware?
Because those Clifford gates are essentially free and superbly protected. Braiding Majorana-based Ising anyons realizes Clifford operations whose action depends only on the topology of the worldlines, so local noise that does not move anyons around each other cannot corrupt them — exponential error suppression that ordinary qubits reach only through costly active correction. The one missing gate, the non-Clifford , is added by magic-state distillation. The bet is that a little expensive distillation on a lot of cheap, protected braiding beats error-correcting conventional qubits.
Why does the golden ratio appear in the Fibonacci model?
It is forced by the fusion rule . Replace each charge by its quantum dimension and the rule becomes , whose positive root is . The same relation sizes the fusion space: fusion histories obey the recurrence , whose successive-term ratio converges to , and the -matrix entries are powers of because the pentagon equation inherits the same quadratic. The golden ratio is the one number consistent with a charge that self-fuses to either nothing or itself.
Is a single braid a quantum gate I can just apply?
A single braid is a fixed unitary — a specific rotation of the fusion space — not an adjustable gate. For Ising that fixed unitary is a Clifford gate (, , or an entangler), directly useful. For Fibonacci a single braid is some irrational rotation of the Bloch sphere; only the closure of all braid words is dense in . To realize a target gate you compile it into a braid sequence with the Solovay–Kitaev algorithm, of length polylogarithmic in the accuracy demanded. "Braiding is universal" is about long braid sequences, not one exchange equalling an arbitrary gate.
How are Ising anyons related to Majorana zero modes?
They are two descriptions of the same physics. A Majorana zero mode is a self-conjugate zero-energy bound state — at the end of a topological superconducting wire, or in a vortex core — and a pair of them shares one nonlocal fermionic state that can be empty or filled. That two-way choice is exactly the channel of the Ising anyon, and exchanging two vortices braids the Majoranas to reproduce the Ising -matrix and its Clifford gate. This is why "Majorana-based" and "Ising anyon" hardware mean the same thing, and why the state (Moore–Read Pfaffian) hosts Ising anyons.
Do the two theories have the same total quantum dimension by coincidence?
Their total quantum dimensions are close — versus — but this does not govern computational power, and treating it as such is a trap. The total quantum dimension measures how much protected information the theory stores and fixes the topological entanglement entropy (0.643 versus 0.693). What decides universality is instead the braid-group image: dense for Fibonacci, finite for Ising — capacity and capability are separate axes.