The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Universal quantum computation with theν=5∕2fractional quantum Hall state
Open accessAbstract
We consider topological quantum computation (TQC) with a particular class of anyons that are believed to exist in the fractional quantum Hall effect state at Landau-level filling fraction $\ensuremath{\nu}=5∕2$. Since the braid group representation describing the statistics of these anyons is not computationally universal, one cannot directly apply the standard TQC technique. We propose to use very noisy nontopological operations such as direct short-range interactions between anyons to simulate a universal set of gates. Assuming that all TQC operations are implemented perfectly, we prove that the threshold error rate for nontopological operations is above $14%$. The total number of nontopological computational elements that one needs to simulate a quantum circuit with $L$ gates scales as $L(\mathrm{ln}\phantom{\rule{0.2em}{0ex}}L{)}^{3}$.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Anyons in an exactly solved model and beyond
Kitaev, A. (2006) · Annals of Physics · doi:10.1016/j.aop.2005.10.005 · Cited by 5,245
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Self-citationQuantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Observation of an even-denominator quantum number in the fractional quantum Hall effect
Willett, R., Eisenstein, J. P., Störmer, H. L., Tsui, D. C., Gossard, A. C., & English, J. H. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.1776 · Cited by 1,135
Bravyi, S. B., & Kitaev, A. Y. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6254 · Cited by 1,033
Self-citationClassical simulation of noninteracting-fermion quantum circuits
Terhal, B. M., & DiVincenzo, D. P. (2002) · Physical Review A · doi:10.1103/physreva.65.032325 · Cited by 329
Cited by
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861
New directions in the pursuit of Majorana fermions in solid state systems
Alicea, J. (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/7/076501 · Cited by 2,854
Majorana zero modes and topological quantum computation
Sarma, S. D., Freedman, M., & Nayak, C. (2015) · npj Quantum Information · doi:10.1038/npjqi.2015.1 · Cited by 1,180
Majorana zero modes in superconductor–semiconductor heterostructures
Lutchyn, R. M., Bakkers, E. P. A. M., Kouwenhoven, L. P., Krogstrup, P., Marcus, C. M., & Oreg, Y. (2018) · Nature Reviews Materials · doi:10.1038/s41578-018-0003-1 · Cited by 992
Introduction to topological superconductivity and Majorana fermions
Leijnse, M., & Flensberg, K. (2012) · Semiconductor Science and Technology · doi:10.1088/0268-1242/27/12/124003 · Cited by 834
Metadata
- Authors
- Bravyi, S.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2006-04-12
- Volume
- 73
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1977557377
- Cited by
- 250
- References
- 8
- FWCI
- 11.10
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Universal quantum computation with theν=5∕2fractional quantum Hall state. https://app.cochat.ai/papers/10.1103/physreva.73.042313
- The paper
- Bravyi, S. (2006). Universal quantum computation with theν=5∕2fractional quantum Hall state. Physical Review A. https://doi.org/10.1103/physreva.73.042313
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.