Introduction to topological quantum computation with non-Abelian anyons
Open accessThe DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
Abstract Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Then we use a simulation of a topological quantum computer to explicitly demonstrate a quantum computation using Fibonacci anyons, evaluating the Jones polynomial of a selection of simple knots. In addition to simulating a modular circuit-style quantum algorithm, we also show how the magnitude of the Jones polynomial at specific points could be obtained exactly using Fibonacci or Ising anyons. Such an exact algorithm seems ideally suited for a proof of concept demonstration of a topological quantum computer.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 · cited 2×
“However, for other quantum algorithms where the measured quantity is a particular state which is observed with high probability, as for Shor’s factorisation algorithm (Shor, 1994), then a smaller (possibly constant) factor would replace the quadratic factor.”
BackgroundQuantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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 · cited 25×
“The Fibonacci model appears in the SU(2)3 Witten–Cherns–Simmons topological quantum field theory (Freedman et al., 2003, 2002b; Nayak et al., 2008; Preskill, 2004).”
BackgroundMethodInfluentialQuantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840 · cited 1×
“In contrast to locally encoding information and computation using, for example, the spin of an electron (Castelvecchi, 2018; Kane, 1998; Loss and DiVincenzo, 1998; Reilly et al., 2008), the energy levels of an ion (Cirac and Zoller, 1995; Leibfried et al., 2003), optical modes containing one photon…”
BackgroundA scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Quantum field theory and the Jones polynomial
Witten, E. (1989) · Communications in Mathematical Physics · doi:10.1007/bf01217730 · Cited by 4,758
Decoherence, einselection, and the quantum origins of the classical
Zurek, W. H. (2003) · Reviews of Modern Physics · doi:10.1103/revmodphys.75.715 · Cited by 4,295 · cited 3×
“A major source of error in quantum computation is decoherence, caused by interactions between the quantum state and the environment, which causes uncontrolled randomness in the system (Pachos, 2012; Zurek, 2003).”
BackgroundA silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779 · cited 1×
“In contrast to locally encoding information and computation using, for example, the spin of an electron (Castelvecchi, 2018; Kane, 1998; Loss and DiVincenzo, 1998; Reilly et al., 2008), the energy levels of an ion (Cirac and Zoller, 1995; Leibfried et al., 2003), optical modes containing one photon…”
BackgroundQuantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733 · cited 1×
“…for example, the spin of an electron (Castelvecchi, 2018; Kane, 1998; Loss and DiVincenzo, 1998; Reilly et al., 2008), the energy levels of an ion (Cirac and Zoller, 1995; Leibfried et al., 2003), optical modes containing one photon (Knill et al., 2001), or superconducting Josephson junctions…”
BackgroundLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“Using this exponentially large computation space, it is possible, at least in principle, for quantum computers to efficiently solve classically difficult problems such as prime factorisation of large numbers (Shor, 1994) or the simulation of complex quantum systems (Feynman, 1982; Lloyd, 1996).”
BackgroundQuantum dynamics of single trapped ions
Leibfried, D., Blatt, R., Monroe, C., & Wineland, D. (2003) · Reviews of Modern Physics · doi:10.1103/revmodphys.75.281 · Cited by 2,739 · cited 1×
“…an electron (Castelvecchi, 2018; Kane, 1998; Loss and DiVincenzo, 1998; Reilly et al., 2008), the energy levels of an ion (Cirac and Zoller, 1995; Leibfried et al., 2003), optical modes containing one photon (Knill et al., 2001), or superconducting Josephson junctions (Shnirman et al., 1997),…”
BackgroundQuantum mechanics of fractional-spin particles
Wilczek, F. (1982) · Physical Review Letters · doi:10.1103/physrevlett.49.957 · Cited by 1,694
The classical-quantum boundary for correlations: Discord and related measures
Modi, K., Brodutch, A., Cable, H., Paterek, T., & Vedral, V. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.1655 · Cited by 1,600
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
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
Berezinskii–Kosterlitz–Thouless crossover in a trapped atomic gas
Hadzibabic, Z., Krüger, P., Cheneau, M., Battelier, B., & Dalibard, J. (2006) · Nature · doi:10.1038/nature04851 · Cited by 972 · cited 1×
“Thermal fluctuations can create 20 spurious anyon pairs (Hadzibabic et al., 2006; Kosterlitz, 2017; Simula and Blakie, 2006), which might braid non-trivially with the intentionally created anyons (Kitaev, 2003; Nayak et al., 2008).”
BackgroundA Modular Functor Which is Universal¶for Quantum Computation
Freedman, M. H., Larsen, M., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200645 · Cited by 573 · cited 5×
“The Fibonacci model appears in the SU(2)3 Witten–Cherns–Simmons topological quantum field theory (Freedman et al., 2003, 2002b; Nayak et al., 2008; Preskill, 2004).”
BackgroundMethodResultInfluentialWallis, S. (2013) · Journal of Quantitative Linguistics · doi:10.1080/09296174.2013.799918 · Cited by 313 · cited 1×
“…this was a Bernoulli experiment, where the number of |0〉 outcomes were simply counted, the confidence interval for the measured Pr(|0〉) was approximated using a method for determining binomial confidence intervals, namely the Wilson score interval (Wallis, 2013), which can be calculated as follows.”
MethodDawson, C. M., & Nielsen, M. A. (2006) · Quantum Information and Computation · doi:10.26421/qic6.1-6 · Cited by 288
Introduction to Topological Quantum Matter & Quantum Computation
Stanescu, T. D. (2016) · doi:10.1201/9781315181509 · Cited by 50
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., Draeger, E. W., Holland, E. T., & Wisnieff, R. (2017) · arXiv · doi:10.48550/arxiv.1710.05867 · Cited by 48
Cited by
Non-Abelian braiding of graph vertices in a superconducting processor
Collaborators, G. Q. A. A., Andersen, T. I., Lensky, Y. D., Kechedzhi, K., Drozdov, I. K., Bengtsson, A., Hong, S., Morvan, A., Mi, X., Opremcak, A., et al. (2023) · Nature · doi:10.1038/s41586-023-05954-4 · Cited by 108
Entanglement production and convergence properties of the variational quantum eigensolver
Woitzik, A. J. C., Barkoutsos, P. K., Wudarski, F., Buchleitner, A., & Tavernelli, I. (2020) · Physical Review A · doi:10.1103/physreva.102.042402 · Cited by 20
Phases of interacting Fibonacci anyons on a ladder at half-filling
Kirchner, N., Moessner, R., Pollmann, F., & Gammon-Smith, A. (2026) · Physical Review B · doi:10.1103/c92g-mhly
Metadata
- Authors
- Field, B., & Simula, T.
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2018-07-10
- Volume
- 3
- Issue
- 4
- Pages
- 045004
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W2798318133
- Cited by
- 124
- References
- 22
- FWCI
- 3.11
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.