Topological quantum computing with Read-Rezayi states.
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...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2009
|
| _version_ | 1797066869274836992 |
|---|---|
| author | Hormozi, L Bonesteel, N Simon, S |
| author_facet | Hormozi, L Bonesteel, N Simon, S |
| author_sort | Hormozi, L |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-06T21:48:11Z |
| format | Journal article |
| id | oxford-uuid:4a57ea53-7ddf-4188-8847-5e96390b7ece |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T21:48:11Z |
| publishDate | 2009 |
| record_format | dspace |
| spelling | oxford-uuid:4a57ea53-7ddf-4188-8847-5e96390b7ece2022-03-26T15:36:54ZTopological quantum computing with Read-Rezayi states.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:4a57ea53-7ddf-4188-8847-5e96390b7eceEnglishSymplectic Elements at Oxford2009Hormozi, LBonesteel, NSimon, SRead-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. |
| spellingShingle | Hormozi, L Bonesteel, N Simon, S Topological quantum computing with Read-Rezayi states. |
| title | Topological quantum computing with Read-Rezayi states. |
| title_full | Topological quantum computing with Read-Rezayi states. |
| title_fullStr | Topological quantum computing with Read-Rezayi states. |
| title_full_unstemmed | Topological quantum computing with Read-Rezayi states. |
| title_short | Topological quantum computing with Read-Rezayi states. |
| title_sort | topological quantum computing with read rezayi states |
| work_keys_str_mv | AT hormozil topologicalquantumcomputingwithreadrezayistates AT bonesteeln topologicalquantumcomputingwithreadrezayistates AT simons topologicalquantumcomputingwithreadrezayistates |