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 (FF) and braiding (RR) 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 τ\tau obeys τ×τ=1+τ\tau\times\tau=1+\tau, 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 {1,σ,ψ}\{1,\sigma,\psi\} are the anyon content of the Majorana / p+ipp+ip superconductor and the Moore–Read ν=5/2\nu=5/2 state, and braiding σ\sigma 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.

Key takeaways
  • Fibonacci anyons have a single nontrivial charge τ\tau with τ×τ=1+τ\tau\times\tau=1+\tau; braiding them is dense in PU(2)\mathrm{PU}(2) on each fusion space, so braids alone are universal for quantum computation.
  • Ising anyons have charges {1,σ,ψ}\{1,\sigma,\psi\} with σ×σ=1+ψ\sigma\times\sigma=1+\psi, σ×ψ=σ\sigma\times\psi=\sigma, ψ×ψ=1\psi\times\psi=1; their braids generate only the Clifford group, which Gottesman–Knill makes classically simulable — non-universal.
  • Both theories are fixed by their FF-matrices (fusion associativity) and RR-matrices (braiding phases), constrained by the pentagon and hexagon equations up to gauge.
  • Quantum dimensions read off the fusion rules: dτ=φ=(1+5)/2≈1.618d_\tau=\varphi=(1+\sqrt5)/2\approx1.618, dσ=2d_\sigma=\sqrt2; total quantum dimensions DFib=1+φ2≈1.902\mathcal D_{\mathrm{Fib}}=\sqrt{1+\varphi^2}\approx1.902 and DIsing=2\mathcal D_{\mathrm{Ising}}=2.
  • Ising's missing T=diag(1,eiπ/4)T=\mathrm{diag}(1,e^{i\pi/4}) gate is supplied by magic-state distillation, restoring universality while the Clifford part stays topologically protected; Ising arises from Majorana modes and the ν=5/2\nu=5/2 state, Fibonacci is sought in ν=12/5\nu=12/5.
  • Key idea: an anyon theory's computational power is decided by whether its braid-group image in PU(fusion space)\mathrm{PU}(\text{fusion space}) is dense (Fibonacci ⇒ universal) or finite (Ising ⇒ Clifford-only); the FF and RR data satisfying the pentagon and hexagon equations are all you need to compute either.
The core insight

An anyon theory's computational power is fixed by whether the braid-group image in PU(fusion space)\mathrm{PU}(\text{fusion space}) is dense (Fibonacci ⇒ universal) or finite (Ising ⇒ Clifford-only); the FF and RR 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 σ\sigma 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 ν=5/2\nu=5/2 plateau — home of Ising anyons — is probed by thermal-Hall measurements. Fibonacci anyons are the harder prize: none has been produced, the leading ν=12/5\nu=12/5 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 nn copies of τ\tau to charge τ\tau gives dimension the nn-th Fibonacci number, growing like φ n\varphi^{\,n}: the quantum dimension φ≈1.618\varphi\approx1.618 is the degeneracy-growth rate per anyon, the golden ratio solving φ2=φ+1\varphi^2=\varphi+1.

Figure
The protected Hilbert space of n Fibonacci τ-anyons has dimension Fₙ — the Fibonacci numbers 1, 2, 3, 5, 8, 13, 21, 34 — growing as φⁿ divided by √5 with quantum dimension φ = 1.618 obeying φ² = φ + 1
Exponential degeneracy: dim ℋₙ = Fₙ grows as φⁿ, quantum dimension φ = 1.618 number of τ-anyons n (total charge τ) protected dimension Fₙ 1 2 3 5 8 13 21 34 2 3 4 5 6 7 8 9 n = 3 → dim 2 one encoded qubit envelope φⁿ / √5 φ² = φ + 1 = 2.618

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 π/2\pi/2 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.

Figure
Two Bloch spheres of the encoded qubit: Fibonacci braids fill PU(2) densely so the theory is universal with dₜ = φ ≈ 1.618, while Ising braids land only on the finite Clifford set of 24 rotations so the theory is non-universal with dₛ = √2
Dense vs finite: the braid-group image decides computational power Fibonacci τ × τ = 1 + τ image dense in PU(2) UNIVERSAL · dₜ = φ ≈ 1.618 · 𝒟 ≈ 1.902 Ising σ × σ = 1 + ψ finite Clifford set, order 24 NON-UNIVERSAL · dₛ = √2 · 𝒟 = 2 braid

Neither model is an exotic curiosity. They are the two simplest members of the SU(2)kSU(2)_k family: k=2k=2 is the Ising-like non-universal theory, k=3k=3 is Fibonacci, and the Freedman–Larsen–Wang theorem shows every k≥3k\ge3 except k=4k=4 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.

τ×τ=1+τ(1)\tau\times\tau=1+\tau \qquad (1)

where: τ\tau — the unique nontrivial anyon charge; 11 — the vacuum charge (fusion identity); ++ — direct sum of distinct fusion channels, here multiplicity-free. Reading it: two τ\tau's fuse either to vacuum or back to τ\tau, and which outcome occurs stores a qubit of protected information. Ising has three charges but the same shape: one non-Abelian σ\sigma that self-fuses two ways, plus an Abelian fermion ψ\psi.

σ×σ=1+ψ,σ×ψ=σ,ψ×ψ=1(2)\sigma\times\sigma=1+\psi,\qquad \sigma\times\psi=\sigma,\qquad \psi\times\psi=1 \qquad (2)

where: σ\sigma — the non-Abelian anyon (Majorana / Ising spin field), dσ=2d_\sigma=\sqrt2; ψ\psi — an Abelian fermion, dψ=1d_\psi=1, its own antiparticle; 11 — vacuum. Reading it: σ×σ\sigma\times\sigma has two channels so σ\sigma is non-Abelian; ψ×ψ\psi\times\psi has one outcome so ψ\psi 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 NaN_a, read off the fusion rule.

Na v⃗=da v⃗,dτ2=dτ+1⇒dτ=φ,dσ2=1+1⇒dσ=2(3)N_a\,\vec v=d_a\,\vec v,\qquad d_\tau^2=d_\tau+1\Rightarrow d_\tau=\varphi,\qquad d_\sigma^2=1+1\Rightarrow d_\sigma=\sqrt2 \qquad (3)

where: NaN_a — the matrix (Na)bc=Nab c(N_a)_{bc}=N_{ab}^{\,c} counting fusion channels; dad_a — quantum dimension (Perron–Frobenius eigenvalue); φ=(1+5)/2\varphi=(1+\sqrt5)/2. Reading it: dτ2=dτ+1d_\tau^2=d_\tau+1 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 FF-matrix, which for three τ\tau's of total charge τ\tau is a 2×22\times2 orthogonal matrix fixed (up to gauge) by the pentagon equation.

Fττττ=(φ−1φ−1/2φ−1/2−φ−1),(Fττττ)2=1(4)F^{\tau\tau\tau}_{\tau}=\begin{pmatrix}\varphi^{-1}&\varphi^{-1/2}\\[2pt] \varphi^{-1/2}&-\varphi^{-1}\end{pmatrix},\qquad \big(F^{\tau\tau\tau}_{\tau}\big)^2=\mathbb 1 \qquad (4)

where: FττττF^{\tau\tau\tau}_{\tau} — change of basis between the left-associated tree ((ττ)τ)((\tau\tau)\tau) and the right-associated (τ(ττ))(\tau(\tau\tau)) on the space of three τ\tau's with total charge τ\tau; φ−1≈0.618\varphi^{-1}\approx0.618, φ−1/2≈0.786\varphi^{-1/2}\approx0.786. 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 RR-matrices, differing decisively between the two theories.

Rττ=diag ⁣(e−4πi/5, e3πi/5),Rσσ=diag ⁣(e−iπ/8, ei3π/8)(5)R^{\tau\tau}=\mathrm{diag}\!\left(e^{-4\pi i/5},\,e^{3\pi i/5}\right),\qquad R^{\sigma\sigma}=\mathrm{diag}\!\left(e^{-i\pi/8},\,e^{i3\pi/8}\right) \qquad (5)

where: the first entry is the phase for the pair fusing to vacuum, the second for the nontrivial channel (τ\tau for Fibonacci, ψ\psi for Ising). Reading it: the ratio of the Ising phases is ei3π/8/e−iπ/8=eiπ/2=ie^{i3\pi/8}/e^{-i\pi/8}=e^{i\pi/2}=i, an SS-gate relative phase, whereas the Fibonacci ratio ei7π/5e^{i7\pi/5} 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.

dim⁡HnFib=Fn∼φ n5,dim⁡H2nIsing=2 n−1(6)\dim\mathcal H_n^{\mathrm{Fib}}=F_n\sim\frac{\varphi^{\,n}}{\sqrt5},\qquad \dim\mathcal H_{2n}^{\mathrm{Ising}}=2^{\,n-1} \qquad (6)

where: Hn\mathcal H_n — space of nn τ\tau-anyons at fixed total charge; FnF_n — the nn-th Fibonacci number; for Ising, 2n2n σ\sigma's encode n−1n-1 qubits, so four σ\sigma's give one qubit. Reading it: the Fibonacci dimension is not a power of two — the fingerprint of a genuinely non-Abelian, universal medium.

Derivation AThe Fibonacci F-matrix from the pentagon equation

The goal is to show that the 2×22\times2 Fibonacci FF-matrix of equation (4) is not an assumption but a consequence: once you demand that the two ways of reassociating a chain of τ\tau 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 τ\tau's of total charge τ\tau and impose the constraints until the matrix is fixed up to a gauge choice.

Step 1. Label the two basis states of three τ\tau's (total charge τ\tau) by the intermediate charge a∈{1,τ}a\in\{1,\tau\} of the first pair. The FF-move rewrites the same state in the other pairing, a linear map on this two-dimensional space; unitarity forces FF 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 FF-moves relating the five pairings of four τ\tau's must give the same unitary. For Fibonacci this collapses to scalar relations in the entries, the key one being F11(1−F11)=F1τFτ1F_{11}(1-F_{11})=F_{1\tau}F_{\tau1}. Why: the pentagon is the associativity axiom, the algebraic content of "reassociation is unambiguous".

Step 3. Combine with unitarity F2=1F^2=\mathbb 1, giving F112+F1τ2=1F_{11}^2+F_{1\tau}^2=1 and F11=−FττF_{11}=-F_{\tau\tau}. With F11=xF_{11}=x the pentagon relation becomes x(1−x)=1−x2x(1-x)=1-x^2, so x=φ−1x=\varphi^{-1} (using φ−1+φ−2=1\varphi^{-1}+\varphi^{-2}=1) and F1τ=1−φ−2=φ−1/2F_{1\tau}=\sqrt{1-\varphi^{-2}}=\varphi^{-1/2}. Why: the golden ratio is forced — the unique solution consistent with both pentagon and unitarity, mirroring dτ=φd_\tau=\varphi.

Step 4. Assemble: Fττττ=(φ−1φ−1/2φ−1/2−φ−1)F^{\tau\tau\tau}_{\tau}=\begin{pmatrix}\varphi^{-1}&\varphi^{-1/2}\\ \varphi^{-1/2}&-\varphi^{-1}\end{pmatrix}, and squaring gives F2=1F^2=\mathbb 1 since the diagonal is φ−2+φ−1=1\varphi^{-2}+\varphi^{-1}=1 and the off-diagonal cancels. Why: FF 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
Derivation BWhy Fibonacci braiding is universal

The goal is to show that the two elementary braids on three τ\tau-anyons generate a dense subgroup of PU(2)\mathrm{PU}(2), 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 BQP\mathsf{BQP}. We encode the qubit in three τ\tau's of total charge τ\tau (two-dimensional since F3=2F_3=2), with basis labelled by the intermediate charge 11 or τ\tau.

Step 1. The first generator braids anyons 1 and 2, diagonal in this basis: σ1=Rττ=diag(e−4πi/5,e3πi/5)\sigma_1=R^{\tau\tau}=\mathrm{diag}(e^{-4\pi i/5},e^{3\pi i/5}), a zz-axis Bloch rotation by the phase difference 7π/57\pi/5. Why: braiding the first pair acts directly on the intermediate charge, so the gate is simply the RR-matrix.

Step 2. The second generator braids anyons 2 and 3, so we change to the other fusion tree with FF, braid, and change back: σ2=F RττF−1=F σ1 F\sigma_2=F\,R^{\tau\tau}F^{-1}=F\,\sigma_1\,F (using F−1=FF^{-1}=F). Since FF rotates by an angle with cosine φ−1\varphi^{-1}, σ2\sigma_2 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 PU(2)\mathrm{PU}(2) unless the group is finite; here the angles are rational multiples of π\pi 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 SU(2)3SU(2)_3. 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 ε\varepsilon by a braid word of length L=O(log⁡c(1/ε))L=O(\log^{c}(1/\varepsilon)), c≈3.97c\approx3.97 (and c→1c\to1 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 U(2n)\mathrm{U}(2^n) densely.

Go deeper · Derivation C · 1 minWhy Ising braiding gives only Clifford gates
Derivation CWhy Ising braiding gives only Clifford gates

The goal is to compute the gates σ\sigma-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 σ\sigma anyons of total charge 11, basis the fusion channel (11 or ψ\psi) of the first pair — two-dimensional, since dim⁡H4Ising=22−1=2\dim\mathcal H_4^{\mathrm{Ising}}=2^{2-1}=2.

Step 1. Braiding the two anyons inside a pair multiplies the channels by R1σσ=e−iπ/8R^{\sigma\sigma}_1=e^{-i\pi/8} and Rψσσ=ei3π/8R^{\sigma\sigma}_\psi=e^{i3\pi/8}; the ratio is eiπ/2=ie^{i\pi/2}=i, so up to global phase the gate is diag(1,i)=S\mathrm{diag}(1,i)=S. Why: only the relative phase is physical, and here it is exactly the π/2\pi/2 of the Z=S\sqrt Z=S gate.

Step 2. Braiding across the two pairs is the FF-conjugated exchange σ2=FσRσσ(Fσ)−1\sigma_2=F^{\sigma}R^{\sigma\sigma}(F^{\sigma})^{-1}, and with Fσ=12(111−1)=HF^\sigma=\tfrac1{\sqrt2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}=H this is (up to phase) the Hadamard HH. Why: the Ising recoupling matrix is literally Hadamard, so the tilted braid is the second Clifford generator.

Step 3. The group generated by {S,H}\{S,H\} is the 24-element single-qubit Clifford group C1\mathrm{C}_1 — the octahedral rotation group of the Bloch sphere, finite and not dense, so single-qubit universality already fails. Why: SS and HH have orders 4 and 2 and close after 24 elements; no braid escapes the octahedron.

Step 4. Braiding between two four-σ\sigma qubits gives an entangler equivalent to CNOT\mathrm{CNOT} up to Clifford, so the braid group maps onto ⟨S,H,CNOT⟩\langle S,H,\mathrm{CNOT}\rangle — 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 ∣A⟩=(∣0⟩+eiπ/4∣1⟩)/2|A\rangle=(|0\rangle+e^{i\pi/4}|1\rangle)/\sqrt2 gate-teleports T=diag(1,eiπ/4)T=\mathrm{diag}(1,e^{i\pi/4}) using only Clifford operations and measurement, and distilling noisy copies into clean ones promotes the protected Clifford set to a universal one. Why: {Clifford,T}\{\text{Clifford},T\} is universal, so the one missing π/8\pi/8 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.

CaseResultMeaning
Fibonacci quantum dimensiondτ=φ=1+52≈1.618d_\tau=\varphi=\tfrac{1+\sqrt5}{2}\approx1.618solves d2=1+dd^2=1+d, the fusion rule τ×τ=1+τ\tau\times\tau=1+\tau; degeneracy grows as φ n\varphi^{\,n}
Ising quantum dimensionsdσ=2, dψ=1d_\sigma=\sqrt2,\ d_\psi=1dσ2=1+1d_\sigma^2=1+1 from σ×σ=1+ψ\sigma\times\sigma=1+\psi; 2n2n σ\sigma's span a 2 n−12^{\,n-1}-dimensional space
Total quantum dimensionD=∑ada2\mathcal D=\sqrt{\textstyle\sum_a d_a^2}Fibonacci D=1+φ2≈1.902\mathcal D=\sqrt{1+\varphi^2}\approx1.902; Ising D=1+2+1=2\mathcal D=\sqrt{1+2+1}=2
Topological spinsθτ=e4πi/5, θσ=eiπ/8, θψ=−1\theta_\tau=e^{4\pi i/5},\ \theta_\sigma=e^{i\pi/8},\ \theta_\psi=-1θψ=−1\theta_\psi=-1 marks ψ\psi as a fermion; Ising carries chiral central charge c=1/2c=1/2
Braid-group imageρ(Bn)‾=PU(2)\overline{\rho(B_n)}=\mathrm{PU}(2) (Fib); ∣ρ(Bn)∣<∞\lvert\rho(B_n)\rvert<\infty (Ising)dense ⇒ universal (Solovay–Kitaev); finite ⇒ Clifford, simulable (Gottesman–Knill)
SU(2)kSU(2)_k placementk=3k=3 (Fib), k=2k=2 (Ising)universal for all k≥3k\ge3 except k=4k=4; the two simplest points bracket the family

Worked examples

1 · The topological qubit and its exponential growth (confidence builder)

How many qubits can nn Fibonacci τ\tau-anyons store, and at what rate does that capacity grow per anyon? Take the total charge fixed to τ\tau, so the protected dimension is FnF_n.

Step 1. Smallest case: for n=3n=3, equation (6) gives dim⁡H3=F3=2\dim\mathcal H_3=F_3=2 — one qubit, its basis labelled by whether the first two τ\tau's fused to 11 or τ\tau. This is the elementary Fibonacci qubit of every braiding-gate construction. Three τ-anyons encode exactly one qubit.

Step 2. Scale up: for n=20n=20, dim⁡H20=F20=6765\dim\mathcal H_{20}=F_{20}=6765, so the qubit count is log⁡26765=12.7\log_2 6765=\mathbf{12.7} — 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 Fn∼φ n/5F_n\sim\varphi^{\,n}/\sqrt5, successive dimensions ratio to φ\varphi, so each anyon multiplies the space by φ≈1.618\varphi\approx1.618 — a capacity of log⁡2φ=0.694\log_2\varphi=\mathbf{0.694} qubits per anyon. Check: φ8/5=21.01\varphi^{8}/\sqrt5=21.01 versus F8=21F_8=21, agreeing to 0.05%0.05\%. 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 σ\sigma 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 R1σσ=e−iπ/8R^{\sigma\sigma}_1=e^{-i\pi/8} and the ψ\psi channel gets Rψσσ=ei3π/8R^{\sigma\sigma}_\psi=e^{i3\pi/8}. Only the relative phase is physical, so factor out the global e−iπ/8e^{-i\pi/8}. The braid is e−iπ/8 diag(1, eiπ/2)e^{-i\pi/8}\,\mathrm{diag}(1,\,e^{i\pi/2}).

Step 2. Evaluate the relative phase: ei3π/8/e−iπ/8=ei(3π/8+π/8)=eiπ/2=ie^{i3\pi/8}/e^{-i\pi/8}=e^{i(3\pi/8+\pi/8)}=e^{i\pi/2}=i. The gate is therefore diag(1,i)=S\mathrm{diag}(1,i)=S up to global phase — the Clifford phase gate, satisfying S2=ZS^2=Z. One in-pair σ-braid realizes the S gate exactly.

Step 3. The inter-pair braid (Fσ=HF^\sigma=H) gives Hadamard, so {S,H}\{S,H\} generates the 24-element Clifford group and an inter-qubit braid adds a CNOT\mathrm{CNOT}-equivalent entangler. No braid ever produces T=diag(1,eiπ/4)T=\mathrm{diag}(1,e^{i\pi/4}), the π/8\pi/8 rotation — the square root of SS that braids cannot reach. The missing gate is T=diag(1,eiπ/4)T=\mathrm{diag}(1,e^{iπ/4}), 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
MF
Michael Freedman
b. 1951, Fields Medal 1986 · topological quantum computation

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 SU(2)kSU(2)_k Chern–Simons theories are dense in the projective unitary groups for every level except k=1,2,4k=1,2,4 — exactly why Fibonacci (k=3k=3) is universal while Ising (k=2k=2) 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 ν=5/2\nu=5/2 state and by Kitaev to Majorana modes; and Fibonacci, the smallest universal one, still hunted in ν=12/5\nu=12/5. 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.

History
1977
— Leinaas and Myrheim show two space dimensions permit statistics beyond bosons and fermions
1982
— Wilczek coins the name anyon for these fractional-statistics quasiparticles
1991
— Moore and Read tie non-Abelian anyons to the ν = 5/2 fractional quantum Hall state
1997
— Kitaev proposes fault-tolerant quantum computation by braiding anyons
2002
— Freedman, Larsen and Wang prove Fibonacci-type braiding is universal for quantum computation

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) φ=(1+5)/2\varphi=(1+\sqrt5)/2 satisfies φ2=φ+1\varphi^2=\varphi+1 and the Fibonacci FF-matrix squares to the identity via φ−1+φ−2=1\varphi^{-1}+\varphi^{-2}=1; (2) dσ=2d_\sigma=\sqrt2 and DFib=1+φ2≈1.902\mathcal D_{\mathrm{Fib}}=\sqrt{1+\varphi^2}\approx1.902, DIsing=2\mathcal D_{\mathrm{Ising}}=2; (3) the Ising ratio Rψσσ/R1σσ=eiπ/2=iR^{\sigma\sigma}_\psi/R^{\sigma\sigma}_1=e^{i\pi/2}=i giving an SS gate, with {S,H,CNOT}\{S,H,\mathrm{CNOT}\} the Clifford group (Gottesman–Knill); (4) the FLW density result for SU(2)3SU(2)_3 and Solovay–Kitaev scaling L=O(log⁡c(1/ε))L=O(\log^c(1/\varepsilon)). Spins θτ=e4πi/5\theta_\tau=e^{4\pi i/5}, θσ=eiπ/8\theta_\sigma=e^{i\pi/8}, θψ=−1\theta_\psi=-1 and F3=2F_3=2, F20=6765F_{20}=6765 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 σ\sigma-braid to watch a Clifford gate appear.

What does "quantum dimension" actually count?

The quantum dimension dad_a is the rate at which the protected space grows per added anyon of type aa: stack nn of them and it grows like da nd_a^{\,n}. For Fibonacci dτ=φ≈1.618d_\tau=\varphi\approx1.618, so each τ\tau multiplies the space by the golden ratio; for Ising dσ=2d_\sigma=\sqrt2, so two σ\sigma's double it. Formally dad_a is the largest eigenvalue of the fusion matrix, which is why τ×τ=1+τ\tau\times\tau=1+\tau becomes dτ2=dτ+1d_\tau^2=d_\tau+1. A non-integer dad_a 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 TT, 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 τ×τ=1+τ\tau\times\tau=1+\tau. Replace each charge by its quantum dimension and the rule becomes dτ2=1+dτd_\tau^2=1+d_\tau, whose positive root is φ=(1+5)/2\varphi=(1+\sqrt5)/2. The same relation sizes the fusion space: fusion histories obey the recurrence Fn=Fn−1+Fn−2F_n=F_{n-1}+F_{n-2}, whose successive-term ratio converges to φ\varphi, and the FF-matrix entries are powers of φ\varphi 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 (SS, HH, 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 PU(2)\mathrm{PU}(2). 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 p+ipp+ip 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 σ×σ=1+ψ\sigma\times\sigma=1+\psi channel of the Ising σ\sigma anyon, and exchanging two vortices braids the Majoranas to reproduce the Ising RR-matrix and its Clifford gate. This is why "Majorana-based" and "Ising anyon" hardware mean the same thing, and why the ν=5/2\nu=5/2 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 — DFib≈1.902\mathcal D_{\mathrm{Fib}}\approx1.902 versus DIsing=2\mathcal D_{\mathrm{Ising}}=2 — but this does not govern computational power, and treating it as such is a trap. The total quantum dimension D=∑ada2\mathcal D=\sqrt{\sum_a d_a^2} measures how much protected information the theory stores and fixes the topological entanglement entropy γ=ln⁡D\gamma=\ln\mathcal D (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.

Before this

Where this leads