Universal topological quantum computing via double-braiding in SU(2) Witten-Chern-Simons theory
classification
🪐 quant-ph
math-phmath.MPmath.QA
keywords
topologicaluniversalanyonscomputingdouble-braidingquantumtheorywitten-chern-simons
read the original abstract
We study the problem of universality in the anyon model described by the $SU(2)$ Witten-Chern-Simons theory at level $k$. A classic theorem of Freedman-Larsen-Wang states that for $k \geq 3, \ k \neq 4$, braiding of the anyons of topological charge $1/2$ is universal for topological quantum computing. For the case of one qubit, we prove a stronger result that double-braiding of such anyons alone is already universal.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Entangling gates for the SU(N) anyons
The paper outlines the generalization of cabling-based entangling gates to SU(N) anyons and identifies differences and new problems that arise.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.