Computational equivalence of the two inequivalent spinor representations of the braid group in the Ising topological quantum computer
arXiv:0812.2337 · doi:10.1088/1742-5468/2009/12/P12013
Abstract
We demonstrate that the two inequivalent spinor representations of the braid group \B_{2n+2}, describing the exchanges of 2n+2 non-Abelian Ising anyons in the Pfaffian topological quantum computer, are equivalent from computational point of view, i.e., the sets of topologically protected quantum gates that could be implemented in both cases by braiding exactly coincide. We give the explicit matrices generating almost all braidings in the spinor representations of the 2n+2 Ising anyons, as well as important recurrence relations. Our detailed analysis allows us to understand better the physical difference between the two inequivalent representations and to propose a process that could determine the type of representation for any concrete physical realization of the Pfaffian quantum computer.
9 pages, 2 figures, published version
References in corpus (6)
- Non-Abelian Anyons and Topological Quantum Computation
- Non-Abelian adiabatic statistics and Hall viscosity in quantum Hall states and p_x+ip_y paired superfluids
- Implementation of Clifford gates in the Ising-anyon topological quantum computer
- Topologically protected quantum gates for computation with non-Abelian anyons in the Pfaffian quantum Hall state
- Towards a universal set of topologically protected gates for quantum computation with Pfaffian qubits
- Ultimate braid-group generators for coordinate exchanges of Ising anyons from the multi-anyon Pfaffian wave functions