Universal quantum computation with metaplectic anyons

We show that braidings of the metaplectic anyons X-epsilon in SO(3)(2) = SU(2)(4) with their total charge equal to the metaplectic mode Y supplemented with projective measurements of the total charge of two metaplectic anyons are universal for quantum computation. We conjecture that similar universal anyonic 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. (C) 2015 AIP Publishing LLC.