The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Fault-tolerant quantum computation by anyons
Open accessAbstract
A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in pairs and observing the result of fusion. Such computation is fault-tolerant by its physical nature.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“If the physical operations are below a critical noise threshold, the logical error rate should be suppressed exponentially as we increase the number of physical qubits per logical qubit.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [4]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Quantum error correction1–4 provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, in which the logical error rate is suppressed exponentially as more qubits are added.”
From Quantum error correction below the surface code threshold (2025) · cites this paper as [4]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Informally, this cornerstone theorem guarantees the existence of a physical error rate below which any arbitrarily long quantum computation can be performed reliably by scaling up the number of qubits of the quantum computer.”
From Quantum error correction and fault tolerance: A comprehensive tutorial (2026) · cites this paper as [25]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Fault-tolerant quantum computing can be attained by encoding non-Abelian anyons in topological materials (Kitaev, 2003) or applying QEC codes (Raussendorf and Harrington, 2007).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Kitaev, 2003
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Following proposals by Han et al (2007) and Pachos (2007), four-and six-qubit graph states were created to mimic the ground state of the Kitaev spin-lattice model (Kitaev, 2003).”
From Multiphoton entanglement and interferometry (2012) · cites this paper as Kitaev, 2003
3 more claims about this paper
Create a free account to see every claim other papers make about this one.
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Kassel, C. (1994) · Cited by 4,396
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516
On the phase transition towards permanent quark confinement
't Hooft, G. (1978) · Nuclear Physics B · doi:10.1016/0550-3213(78)90153-0 · Cited by 1,540
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Self-citationClass of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227
Fractional Statistics and the Quantum Hall Effect
Arovas, D., Schrieffer, J. R., & Wilczek, F. (1984) · Physical Review Letters · doi:10.1103/physrevlett.53.722 · Cited by 1,213
Fractional Statistics and Anyon Superconductivity
Wilczek, F. (1990) · Series on Directions in Condensed Matter Physics · doi:10.1142/0961 · Cited by 1,070
Fault-tolerant quantum computation
Shor, P. W. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 892
Quantum Error Correction and Orthogonal Geometry
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.405 · Cited by 811
Research works printed but not linked: 2
- Dijkgraaf, 1990, Nucl. Phys. B (Proc. Suppl.), 18B
- Castagnoli, 1993, Int. J. Mod. Phys., 32, 2335
Cited by
Colloquium : Topological insulators
Hasan, M. Z., & Kane, C. L. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.3045 · Cited by 19,930
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
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
Self-citationSuperconducting Proximity Effect and Majorana Fermions at the Surface of a Topological Insulator
Fu, L., & Kane, C. L. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.096407 · Cited by 4,868
Doping a Mott insulator: Physics of high-temperature superconductivity
Lee, P. A., Nagaosa, N., & Wen, X.-G. (2006) · Reviews of Modern Physics · doi:10.1103/revmodphys.78.17 · Cited by 4,506
Metadata
- Authors
- Kitaev, A. Y.
- Affiliations
- Landau Institute for Theoretical Physics (RU)
- Corresponding author
- Kitaev, A.Yu.
- ORCID
- Kitaev, A.Yu.
- Venue
- Annals of Physics
- Publisher
- Elsevier BV
- Published
- 2003-01
- Volume
- 303
- Issue
- 1
- Pages
- 2-30
- ISSN
- 0003-4916 (ISSN-L)
- OpenAlex
- W2135273380
- Cited by
- 7,238
- References
- 31
- Citations by year
- 2026: 362 · 2025: 688 · 2024: 568 · 2023: 575 · 2022: 531 · 2021: 487 · 2020: 478 · 2019: 401 · 2018: 348 · 2017: 347 · 2016: 300 · 2015: 256 · 2014: 292 · 2013: 284 · 2012: 221
- FWCI
- 69.93
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- Annals of Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- fault-tolerant quantum computing, anyons, anyonic excitations, two-dimensional quantum systems, topological quantum computation, braiding, fusion rules, quantum error correction
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: Fault-tolerant quantum computation by anyons. https://app.cochat.ai/papers/10.1016/s0003-4916(02)00018-0
- The paper
- Kitaev, A. Y. (2003). Fault-tolerant quantum computation by anyons. Annals of Physics. https://doi.org/10.1016/s0003-4916(02)00018-0
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.