2000 character limit reached
Universal topological quantum computing via double-braiding in SU(2) Witten-Chern-Simons theory (2312.16747v2)
Published 27 Dec 2023 in quant-ph, math-ph, math.MP, and math.QA
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.