Universal Quantum Computation with Metaplectic Anyons

Abstract

We show that braidings of the metaplectic anyons Xε in SO(3)2=SU(2)4 with their total charge equal to the metaplectic mode Y supplemented with measurements of the total charge of two metaplectic anyons are universal for quantum computation. We conjecture that similar universal computing models can be constructed for all metaplectic anyon systems SO(p)2 for any odd prime p≥ 5. In order to prove universality, we find new conceptually appealing universal gate sets for qutrits and qupits.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…