Anyon Condensation and the Color Code
Open accessThe DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
The manipulation of topologically ordered phases of matter to encode and process quantum information forms the cornerstone of many approaches to fault-tolerant quantum computing. Here we demonstrate that fault-tolerant logical operations in these approaches can be interpreted as instances of anyon condensation. We present a constructive theory for anyon condensation and, in tandem, illustrate our theory explicitly using the color-code model. We show that different condensation processes are associated with a general class of domain walls, which can exist in both spacelike and timelike directions. This class includes semitransparent domain walls that condense certain subsets of anyons. We use our theory to classify topological objects and design novel fault-tolerant logic gates for the color code. As a final example, we also argue that dynamical “Floquet codes” can be viewed as a series of condensation operations. We propose a general construction for realizing planar dynamically driven codes based on condensation operations on the color code. We use our construction to introduce a new Calderbank-Shor-Steane–type Floquet code that we call the Floquet color code. Published by the American Physical Society 2024
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
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 · cited 1×
“For this, see also the matching code construction [56] which describes a construction for microscopic stabiliser models in the toric code phase based on Kitaev’s honeycomb model [42], including the model described here.”
MethodUniversal 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 · cited 1×
“Combined with state distillation protocols [79] or other appropriate means let’s us obtain a universal set of fault-tolerant logical operations.”
BackgroundQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 1×
“Fault-tolerant syndrome readout circuits have been proposed [98, 99] where a code is teleported onto a second auxiliary system, such”
BackgroundFault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
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
A 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 1×
“Additionally, there exist a number of distinct ways of performing logical operations on topologically protected quantum states, using unitary dynamics [2, 3], measurement-based methods [9–15], or combinations thereof [16–18].”
BackgroundRestrictions on Transversal Encoded Quantum Gate Sets
Eastin, B., & Knill, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.110502 · Cited by 457
Stim: a fast stabilizer circuit simulator
Gidney, C. (2021) · Quantum · doi:10.22331/q-2021-07-06-497 · Cited by 415 · cited 2×
“We begin by replacing the stabiliser generators associated with plaquettes with detection cells [1, 58, 59].”
BackgroundMethod
Cited by
Color code decoder with improved scaling for correcting circuit-level noise
Lee, S.-H., Li, A., & Bartlett, S. D. (2025) · Quantum · doi:10.22331/q-2025-01-27-1609 · Cited by 16
“Su-perdense circuits use two ancilla qubits per face, which are prepared in a Bell pair so that super-dense coding can be employed.”
Self-citationLow-overhead quantum computing with the color code
Thomsen, F., Kesselring, M. S., Bartlett, S. D., & Brown, B. J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043125 · Cited by 15
Self-citationDecoding quantum color codes with MaxSAT
Berent, L., Burgholzer, L., Derks, P.-J. H. S., Eisert, J., & Wille, R. (2024) · Quantum · doi:10.22331/q-2024-10-23-1506 · Cited by 13
“which defines a [7 , 4 , 3] -code.”
BackgroundSelf-citationFacilitating practical fault-tolerant quantum computing based on color codes
Zhang, J., Wu, Y.-C., & Guo, G.-P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033086 · Cited by 12
Using detector likelihood for benchmarking quantum error correction
Hesner, I., Hetényi, B., & Wootton, J. R. (2025) · Physical Review A · doi:10.1103/physreva.111.052452 · Cited by 3
“[6] and is shown in Fig.”
BackgroundMethodInfluential
Metadata
- Authors
- Kesselring, M. S., Magdalena de la Fuente, J. C., Thomsen, F., Eisert, J., Bartlett, S. D., & Brown, B. J.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2024-03-11
- Volume
- 5
- Issue
- 1
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W4392663133
- Cited by
- 62
- References
- 25
- FWCI
- 9.23
- Type
- journal article
- Language
- en
- Open access
- gold
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.