Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1003.1253 · The European Physical Journal B

Braid matrices and quantum gates for Ising anyons topological quantum computation

Zheyong Fan, Hugo de GARIS

Published Mar 6, 2010• 12 citations
arXivHTMLPDF
DOI
10.1140/epjb/e2010-00087-4

Related papers

Implementation of Clifford gates in the Ising-anyon topological quantum computer

André Ahlbrecht, Lachezar S. Georgiev, Reinhard F. Werner

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.

arXiv:0812.2338•Physical Review A•Mar 11, 2009•57 citations

BRAID GROUP AND TOPOLOGICAL QUANTUM COMPUTING

Takayoshi Ootsuka, 一浩 佐久間

•Apr 1, 2008•0 citations

Computational equivalence of the two inequivalent spinor representations of the braid group in the Ising topological quantum computer

Lachezar S Georgiev

We demonstrate that the two inequivalent spinor representations of the braid group , describing the exchanges of 2 n +2 non-Abelian Ising anyons in the Pfaffian topological quantum computer, are equivalent from the computational point of view, i.e., the sets of topologically protected quantum gates that could be implemented in both cases by braiding exactly coincide. We give the explicit matrices generating almost all braidings in the spinor representations of the 2 n +2 Ising anyons, as well as important recurrence relations. Our detailed analysis allows us to understand better the physical difference between the two inequivalent representations and to propose a process that could determine the type of representation for any concrete physical realization of the Pfaffian quantum computer.

arXiv:0812.2337•Journal of Statistical Mechanics Theory and Experiment•Dec 21, 2009•3 citations

Braiding of majorana fermions and topological quantum computation

Louis Hirsch Kauffman

Journal of Material Science & Engineering•Nov 16, 2016•0 citations

Systematic Construction of Braids for Topological Quantum Computation

Caitlin Carnahan, Daniel Zeuch, N. E. Bonesteel

Bulletin of the American Physical Society•Mar 19, 2013•0 citations

Golden Ratio Confirmed as Physical Constant in Topological Quantum Computation — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Fibonacci anyons — whose braiding statistics are governed by the golden ratio — have been experimentally realized (Quantinuum) and theoretically compiled into universal single-qubit gates, confirming the golden ratio as a physical constant of topological quantum computation. | MATH: Fibonacci anyon quantum dimension \( d = \phi = \frac{1+\sqrt{5}}{2} \approx 1.618 \); fusion rule \( \tau \times \tau = 1 + \tau \) (non-Abelian); braid matrices satisfy \( \sigma_i^2 \neq 1 \) but Yang-Baxter \( \sigma_i \sigma_{i+1} \sigma_i = \sigma_{i+1} \sigma_i \sigma_{i+1} \); single-qubit gate compilation uses \( F \)-matrix with entries involving \( \phi^{-1} = \phi - 1 \approx 0.618 \) and \( \phi^{-1/2} \). The Ising anyon has \( d = \sqrt{2} \), but Fibonacci is universal for topological QC while Ising is not (without magic state distillation). | CONNECTION: Direct geometric harmony — the golden ratio \( \phi \) appears as the quantum dimension, and its inverse \( \phi^{-1} = 0.618 \) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 18, 2026•0 citations
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 demonstrate that the two inequivalent spinor representations of the braid group , describing the exchanges of 2 n +2 non-Abelian Ising anyons in the Pfaffian topological quantum computer, are equivalent from the computational point of view, i.e., the sets of topologically protected quantum gates that could be implemented in both cases by braiding exactly coincide. We give the explicit matrices generating almost all braidings in the spinor representations of the 2 n +2 Ising anyons, as well as important recurrence relations. Our detailed analysis allows us to understand better the physical difference between the two inequivalent representations and to propose a process that could determine the type of representation for any concrete physical realization of the Pfaffian quantum computer.
FINDING: Fibonacci anyons — whose braiding statistics are governed by the golden ratio — have been experimentally realized (Quantinuum) and theoretically compiled into universal single-qubit gates, confirming the golden ratio as a physical constant of topological quantum computation. | MATH: Fibonacci anyon quantum dimension d=ϕ=1+52≈1.618 d = \phi = \frac{1+\sqrt{5}}{2} \approx 1.618 d=ϕ=21+5​​≈1.618; fusion rule τ×τ=1+τ \tau \times \tau = 1 + \tau τ×τ=1+τ (non-Abelian); braid matrices satisfy σi2≠1 \sigma_i^2 \neq 1 σi2​=1 but Yang-Baxter σiσi+1σi=σi+1σiσi+1 \sigma_i \sigma_{i+1} \sigma_i = \sigma_{i+1} \sigma_i \sigma_{i+1} σi​σi+1​σi​=σi+1​σi​σi+1​; single-qubit gate compilation uses F F F-matrix with entries involving ϕ−1=ϕ−1≈0.618 \phi^{-1} = \phi - 1 \approx 0.618 ϕ−1=ϕ−1≈0.618 and ϕ−1/2 \phi^{-1/2} ϕ−1/2. The Ising anyon has d=2 d = \sqrt{2} d=2​, but Fibonacci is universal for topological QC while Ising is not (without magic state distillation). | CONNECTION: Direct geometric harmony — the golden ratio ϕ \phi ϕ appears as the quantum dimension, and its inverse ϕ−1=0.618 \phi^{-1} = 0.618 ϕ−1=0.618 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com