Universal Quantum Computation with Metaplectic Anyons

preprint2015arXivOpen access

Abstract

We show that braidings of the metaplectic anyons XεX_ε in SO(3)2=SU(2)4SO(3)_2=SU(2)_4 with their total charge equal to the metaplectic mode YY 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)2SO(p)_2 for any odd prime p≥5p\geq 5. In order to prove universality, we find new conceptually appealing universal gate sets for qutrits and qupits.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.