CoChat

Unfolding the color code

Open access
Kubica, Aleksander, Yoshida, Beni, Pastawski, Fernando · 2015 · New Journal of Physics
Cited by 148

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Abstract

The topological color code and the toric code are two leading candidates for realizing fault-tolerant quantum computation. Here we show that the color code on a d -dimensional closed manifold is equivalent to multiple decoupled copies of the d -dimensional toric code up to local unitary transformations and adding or removing ancilla qubits. Our result not only generalizes the proven equivalence for d = 2, but also provides an explicit recipe of how to decouple independent components of the color code, highlighting the importance of colorability in the construction of the code. Moreover, for the d -dimensional color code with boundaries of distinct colors, we find that the code is equivalent to multiple copies of the d -dimensional toric code which are attached along a -dimensional boundary. In particular, for d = 2, we show that the (triangular) color code with boundaries is equivalent to the (folded) toric code with boundaries. We also find that the d -dimensional toric code admits logical non-Pauli gates from the d th level of the Clifford hierarchy, and thus saturates the bound by Bravyi and König. In particular, we show that the logical d -qubit control- Z gate can be fault-tolerantly implemented on the stack of d copies of the toric code by a local unitary transformation.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/1367-2630/17/8/083026

Cites

9 of 9 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 9 references

Research works printed but not linked: 31

  1. Shor P W, 1996, Proc. 37th Annual Symp. on Foundations of Computer Science (FOCS), 56
  2. 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
  3. 10.1063/1.1499754 · DOI · Paper page
  4. 10.1103/PhysRevLett.111.200501 · DOI · Paper page
  5. 10.1103/PhysRevLett.111.090505 · DOI · Paper page
  6. 10.1103/PhysRevA.91.012305 · DOI · Paper page
  7. Sachdev S, 1999, Quantum Phase Transitions
  8. 10.1016/j.aop.2010.10.009 · DOI
  9. 10.1007/s00220-014-1893-4 · DOI
  10. 10.1103/PhysRevA.83.042330 · DOI · Paper page
  11. 10.1103/PhysRevB.88.125122 · DOI · Paper page
  12. Bombin H, 2009, J. Phys. A: Math. Theor., 42, 10.1088/1751-8113/42/9/095302 · DOI · Paper page
  13. Bombin H, 2012, New J. Phys., 14, 10.1088/1367-2630/14/7/073048 · DOI · Paper page
  14. 10.1007/s00220-012-1500-5 · DOI · Paper page
  15. 10.1007/s00220-011-1294-x · DOI · Paper page
  16. 10.1103/PhysRevLett.110.170503 · DOI · Paper page
  17. 10.1103/PhysRevA.89.012317 · DOI · Paper page
  18. 10.1103/PhysRevA.91.032330 · DOI · Paper page
  19. Glaser L C, 1972, Geometrical Combinatorial Topology
  20. Hatcher A, 2002, Algebraic Topology
  21. 10.1103/PhysRevB.75.075103 · DOI · Paper page
  22. 10.1017/CBO9781139034807.021 · DOI
  23. 10.1103/PhysRevA.81.052302 · DOI
  24. 10.1103/PhysRevB.72.045141 · DOI · Paper page
  25. 10.1103/PhysRevB.71.045110 · DOI · Paper page
  26. 10.1103/PhysRevLett.113.130501 · DOI
  27. 10.1103/PhysRevB.86.115109 · DOI · Paper page
  28. 10.1103/PhysRevB.88.235103 · DOI · Paper page
  29. 10.1103/PhysRevX.3.021009 · DOI · Paper page
  30. 10.1103/PhysRevLett.114.076402 · DOI
  31. Bombin H, 2013, New. J. Phys., 15, 10.1088/1367-2630/15/5/055023 · DOI · Paper page

Cited by

See all 148

Metadata

Authors
Kubica, A., Yoshida, B., & Pastawski, F.
Venue
New Journal of Physics
Published
2015-08-13
Volume
17
Issue
8
Pages
083026
ISSN
1367-2630 (ISSN-L)
OpenAlex
W2107817077
Cited by
148
References
9
FWCI
8.45
Type
journal article
Language
en
Open access
gold
Licence
Funders
  • Gordon and Betty Moore Foundation (GBMF-12500028)
  • National Science Foundation (PHY-1125565)

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: Unfolding the color code. https://app.cochat.ai/papers/10.1088/1367-2630/17/8/083026
The paper
Kubica, A., Yoshida, B., & Pastawski, F. (2015). Unfolding the color code. New Journal of Physics. https://doi.org/10.1088/1367-2630/17/8/083026

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.