2009/03/12 by Layla Hormozi, L. Hormozi, N. E. Bonesteel +2 · 2 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum and electron transport phenomena #Quantum many-body systems #cond-mat.mes-hall #quant-ph
paper · pdf · doi:10.1103/physrevlett.103.160501
published as Phys. Rev. Lett. 103, 160501 (2009) · 5 pages, 3 figures
arxiv created 2009/03/12 · openalex publication_date 2009/10/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 not equal 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.