corner
corner

Phys. Rev. Lett. 103, 160501 (2009) [4 pages]

Topological Quantum Computing with Read-Rezayi States

Download: PDF (418 kB) Buy this article Export: BibTeX or EndNote (RIS)

L. Hormozi1, N. E. Bonesteel2, and S. H. Simon3
1Joint Quantum Institute, National Institute of Standards and Technology, and University of Maryland, Gaithersburg, Maryland 20899, USA
2Department of Physics and NHMFL, Florida State University, Tallahassee, Florida 32310, USA
3Rudolf Peierls Centre for Theoretical Physics, Oxford University, 1 Keble Road, Oxford OX1 3NP, United Kingdom

Received 23 March 2009; published 13 October 2009

Read-Rezayi fractional quantum Hall states are among the prime candidates for realizing non-Abelian anyons which, in principle, can be used for topological quantum computation. We present a prescription for efficiently finding braids which can be used to carry out a universal set of quantum gates on encoded qubits based on anyons of the Read-Rezayi states with k>2, k≠4. This work extends previous results which only applied to the case k=3 (Fibonacci) and clarifies why, in that case, gate constructions are simpler than for a generic Read-Rezayi state.

© 2009 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevLett.103.160501
DOI:
10.1103/PhysRevLett.103.160501
PACS:
03.67.Lx, 03.67.Pp, 73.43.−f