Topological Computation without Braiding
Open accessThe DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Abstract
We show that universal quantum computation can be performed within the ground state of a topologically ordered quantum system, which is a naturally protected quantum memory. In particular, we show how this can be achieved using brane-net condensates in 3-colexes. The universal set of gates is implemented without selective addressing of physical qubits and, being fully topologically protected, it does not rely on quasiparticle excitations or their braiding.
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
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
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
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Geometry, Topology and Physics
Nakahara, M. (1990) · doi:10.1887/0750306068 · Cited by 1,620
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Quantum Field Theory of Many-Body Systems
Wen, X.-G. (2007) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199227259.001.0001 · Cited by 1,349
Multiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284
Class 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
Wen, X. G., & Niu, Q. (1990) · Physical Review B · doi:10.1103/physrevb.41.9377 · Cited by 938
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
Cited by
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Quantum error correction for beginners
Devitt, S. J., Munro, W. J., & Nemoto, K. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/7/076001 · Cited by 759
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
Quantum computations on a topologically encoded qubit
Nigg, D., Müller, M., Martinez, E. A., Schindler, P., Hennrich, M., Monz, T., Martin-Delgado, M. A., & Blatt, R. (2014) · Science · doi:10.1126/science.1253742 · Cited by 400
Self-citationTopological Order with a Twist: Ising Anyons from an Abelian Model
Bombin, H. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.030403 · Cited by 369
Self-citationA no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
Bravyi, S., & Terhal, B. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/4/043029 · Cited by 255
Fast Decoders for Topological Quantum Codes
Duclos-Cianci, G., & Poulin, D. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.050504 · Cited by 244
Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Bombín, H. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083002 · Cited by 217
Self-citationOptimal resources for topological two-dimensional stabilizer codes: Comparative study
Bombin, H., & Martin-Delgado, M. A. (2007) · Physical Review A · doi:10.1103/physreva.76.012305 · Cited by 178
“More particularly, we want to compare surface and color codes encoding a single-qubit, which are the most interesting not only as quantum memories but also for quantum computation [5][8].”
BackgroundSelf-citationSingle-Shot Fault-Tolerant Quantum Error Correction
Bombín, H. (2015) · Physical Review X · doi:10.1103/physrevx.5.031043 · Cited by 161
Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms
Cong, I., Levine, H., Keesling, A., Bluvstein, D., Wang, S.-T., & Lukin, M. D. (2022) · Physical Review X · doi:10.1103/physrevx.12.021049 · Cited by 144
Surface code implementation of block code state distillation
Fowler, A. G., Devitt, S. J., & Jones, C. (2013) · Scientific Reports · doi:10.1038/srep01939 · Cited by 99
Fault-tolerant quantum computing with color codes
Landahl, A. J., Anderson, J. T., & Rice, P. R. (2011) · arXiv · doi:10.48550/arxiv.1108.5738 · Cited by 79
Statistical mechanical models and topological color codes
Bombin, H., & Martin-Delgado, M. A. (2008) · Physical Review A · doi:10.1103/physreva.77.042322 · Cited by 39
Self-citationVasmer, M., & Kubica, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030319 · Cited by 39
“One can apply morphing to tetrahedral color codes [19,46,49] to construct HCT codes with a faulttolerant logical T gate.”
BackgroundMethodDecoder for the Triangular Color Code by Matching on a Möbius Strip
Sahay, K., & Brown, B. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010310 · Cited by 38
“This observation is particularly intuitive in topological codes [5, 6, 13, 14, 35, 60] where we have a local structure among the stabilizer operators.”
BackgroundMethodQuantum Error Correction For Dummies
Chatterjee, A., Phalak, K., & Ghosh, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00017 · Cited by 35
General tensor network decoding of 2D Pauli codes
Chubb, C. T. (2021) · arXiv · doi:10.48550/arxiv.2101.04125 · Cited by 20
Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
Menendez, D. H., Ray, A., & Vasmer, M. (2023) · arXiv · doi:10.48550/arxiv.2309.08663 · Cited by 12
Improving Threshold for Fault-Tolerant Color-Code Quantum Computing by Flagged Weight Optimization
Takada, Y., & Fujii, K. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030352 · Cited by 10
Ising model formulation for highly accurate topological color codes decoding
Takada, Y., Takeuchi, Y., & Fujii, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013092 · Cited by 10
“The QEC codes that resolve this drawback are the color codes [18, 19].”
BackgroundRobust sparse IQP sampling in constant depth
Paletta, L., Leverrier, A., Sarlette, A., Mirrahimi, M., & Vuillot, C. (2024) · Quantum · doi:10.22331/q-2024-05-06-1337 · Cited by 8
“First we rely on 3D color codes [25, 26] which admit transversal diagonal gates.”
Code conversion with the quantum Golay code for a universal transversal gate set
Sullivan, M. (2024) · Physical Review A · doi:10.1103/physreva.109.042416 · Cited by 7
Demonstration of measurement-free universal logical quantum computation
Butt, F., Pogorelov, I., Freund, R., Steiner, A., Meyer, M., Monz, T., & Müller, M. (2026) · Nature Communications · doi:10.1038/s41467-026-68533-x · Cited by 2
“The[[8,3,2]]-codeisthesmallestinstanceofathree- dimensional color code 26,27,50 – 52 that encodes k = 3 logical qubit in n = 8 physical qubits and has distance d = 2, meaning that any single error can be detected.”
Metadata
- Authors
- Bombin, H., & Martin-Delgado, M. A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2007-04-19
- Volume
- 98
- Issue
- 16
- Pages
- 160502-160502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2094974378
- Cited by
- 196
- References
- 19
- FWCI
- 8.27
- 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
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.