Loading…
Node axis: universality
…
braiding alone, no distillation
Fibonacci anyon · d_τ = φ
…
τ × τ = 1 + τ ⇒ d² = d + 1
Ising / Majorana · d = √2 (off-φ)
…
the off-golden control
Surrogate threshold p_c
…
code-capacity, small-instance
Interferometric read-out
…
φ in the measured signal
Braid Worldlines: (σ₁σ₂)n on 3 τ-anyons
φCoherent
Fusion-Space Evolution: τ-channel population
dim = F(3) = 2
Interferometric Read-Out: fringe visibility
suppression = 1/φ²
Braid Fidelity vs Length: idealized vs realistic exchange cost
physical p = 0.001 (≈ IBM Heron r3 2q error, ~0.12%)
Universality, made constructive: finding the braid on the D > 2 qudit
bidirectional co-adaptive
Universality guarantees a braid exists for any target gate.
Finding it on the multi-anyon fusion qudit (dimension D = FN > 2) is the
synthesis problem — and Solovay–Kitaev does not apply there. Mean residual error compiling random
reachable targets at a matched search budget, lower is better: the co-adaptive search
(grow a prefix and a suffix together, each scored against the other) gets meet-in-the-middle's
reach and beam pruning, beating one-directional exhaustive search and static
meet-in-the-middle. (Full D = 2…8 sweep: package benchmark
bench_coadaptive_synth.)
Logical Error Rate vs Physical Error Rate (code-capacity surrogate)
d = 3
d = 5
d = 7
Feasibility Budget: does it fit in the car? (per-logical-gate error at 15 mK)
budget NOT closed
…