Computational equivalence of the two inequivalent spinor representations of the braid group in the Ising topological quantum computer

Physics – Condensed Matter – Mesoscale and Nanoscale Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 2 figures, published version

Scientific paper

10.1088/1742-5468/2009/12/P12013

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Computational equivalence of the two inequivalent spinor representations of the braid group in the Ising topological quantum computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational equivalence of the two inequivalent spinor representations of the braid group in the Ising topological quantum computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational equivalence of the two inequivalent spinor representations of the braid group in the Ising topological quantum computer will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-610098

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.