We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for $n\ensuremath{\ge}3$ qubits we prove that the image of the braid group is a nontrivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We also point out which Clifford gates cannot in general be realized by braiding.
We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n\ensuremath≥3 qubits we prove that the image of the braid group is a nontrivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We also point out which Clifford gates cannot in general be realized by braiding.
We show that all quantum gates which could be implemented by braiding of Ising anyons in the Ising topological quantum computer preserve the n‐qubit Pauli group. Analyzing the structure of the Pauli group’s centralizer, also known as the Clifford group, for n≥3 qubits, we prove that the image of the braid group is a non‐trivial subgroup of the Clifford group and therefore not all Clifford gates could be implemented by braiding. We show explicitly the Clifford gates which cannot be realized by braiding estimating in this way the ultimate computational power of the Ising topological quantum computer.
FINDING: Ising anyon braiding gates are exactly the Clifford group; two-qubit braiding exhausts all two-qubit Clifford gates, providing a finite, topologically protected gate set. | MATH: Ising anyon fusion rules: σ×σ = 1+ψ, σ×ψ = σ, ψ×ψ = 1 (Fibonacci-like but with Majorana fermion ψ). Braid matrices: R-matrix for σ exchange acts as phase e^{±iπ/8} on the σ×σ→ψ channel and e^{±iπ/8} on the σ×σ→1 channel (relative phase e^{iπ/4}). Single-qubit braid generators: σ₁ = e^{iπ/8}·(1+iσ_z)/√2 (Hadamard-like), σ₂ = e^{iπ/8}·(1+iσ_x)/√2. These generate the single-qubit Clifford group (order 192, including Pauli group). Two-qubit braid: CNOT = e^{iπ/4}·(1+σ_z⊗σ_x+σ_x⊗σ_z−σ_z⊗σ_z)/2 — realized by a specific 4-strand braid sequence. The π/8 phase e^{iπ/8} is the key constant — it is a primitive 16th root of unity, and its square root e^{iπ/16} would be needed for non-Clifford (T-gate) but is NOT achievable by braiding alone. | CONNECTION: The phase e^{iπ/8} = (1+i)/√2 · e^{iπ/4} — geometrically, Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
FINDING: Braiding of Ising anyons generates only Clifford gates, not universal quantum computation; two-qubit braiding exhausts the full two-qubit Clifford group. | MATH: Ising anyon braid group representation → Clifford group (generated by H, S, CNOT). Key matrices: H = (1/√2)[[1,1],[1,-1]], S = diag(1, i), CNOT. Braid generators σ_i satisfy σ_i² = -1 (fermion parity), σ_i σ_j = σ_j σ_i for |i-j|≥2. The π/8 gate (T = diag(1, e^{iπ/4})) is *not* in the Clifford group — hence not reachable by braiding alone. | CONNECTION: The Clifford group is the normalizer of the Pauli group, isomorphic to the binary symplectic group Sp(2n, F₂) — a root system of type C_n over F₂. The π/8 gate corresponds to a 45° rotation in the Bloch sphere — a geometric angle of π/4, which is *not* a multiple of the golden-ratio-derived angles (π/5, 2π/5) nor of the crystallographic 60° (π/3) or 90° (π/2). The Ising braid matrices live in SU(2) with level-2 Kac-Moody algebra — whose fusion rules (1/2 ⊗ 1/2 = 0 ⊕ 1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Ising-type non-Abelian anyons are likely to occur in a number of physical systems, including quantum Hall systems, where recent experiments support their existence. In general, non-Abelian anyons may be utilized to provide a topologically error-protected medium for quantum information processing. However, the topologically protected operations that may be obtained by braiding and measuring topological charge of Ising anyons are precisely the Clifford gates, which are not computationally universal. The Clifford gate set can be made universal by supplementing it with single-qubit pi/8-phase gates. We propose a method of implementing arbitrary single-qubit phase gates for Ising anyons by running a current of anyons with interfering paths around computational anyons.
We examine how best to design qubits for use in topological quantum computation. These qubits are topological Hilbert spaces associated with small groups of anyons. Operations are performed on these by exchanging the anyons. One might argue that in order to have as many simple single-qubit operations as possible, the number of anyons per group should be maximized. However, we show that there is a maximal number of particles per qubit, namely 4, and more generally a maximal number of particles for qudits of dimension d . We also look at the possibility of having topological qubits for which one can perform two-qubit gates without leakage into non-computational states. It turns out that the requirement that all two-qubit gates are leakage free is very restrictive and this property can only be realized for two-qubit systems related to Ising-like anyon models, which do not allow for universal quantum computation by braiding. Our results follow directly from the representation theory of braid groups, which implies that they are valid for all anyon models. We also make some remarks about generalizations to other exchange groups.
Topological quantum computation encodes quantum information in the internal fusion space of non-Abelian anyonic quasiparticles, whose braiding implements logical gates. This goes beyond Abelian topological order (TO) such as the toric code, as its anyons lack internal structure. However, the simplest non-Abelian generalizations of the toric code do not support universality via braiding alone. Here we demonstrate that such minimally non-Abelian TOs can be made universal by treating anyon fusion as a computational primitive. We prepare a 54-qubit TO wavefunction associated with the smallest non-Abelian group, S3, on Quantinuum's H2 quantum processor. This phase of matter exhibits cyclic anyon fusion rules, known to underpin universality, which we evidence by trapping a single non-Abelian anyon on the torus. We encode logical qutrits in the nonlocal fusion space of non-Abelian fluxes and, by combining an entangling braiding operation with anyon charge measurements, realize a universal topological gate set and read-out, which we further demonstrate by topologically preparing a magic state. This work establishes S3 TO as simple enough to be prepared efficiently, yet rich enough to enable universal topological quantum computation.