CoChat

Triangular color codes on trivalent graphs with flag qubits

Open access
Chamberland, Christopher, Kubica, Aleksander, Yoder, Theodore J, Zhu, Guanyu · 2020 · New Journal of Physics

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

Abstract

The color code is a topological quantum error-correcting code supporting a variety of valuable fault-tolerant logical gates. Its two-dimensional version, the triangular color code, may soon be realized with currently available superconducting hardware despite constrained qubit connectivity. To guide this experimental effort, we study the storage threshold of the triangular color code against circuit-level depolarizing noise. First, we adapt the Restriction Decoder to the setting of the triangular color code and to phenomenological noise. Then, we propose a fault-tolerant implementation of the stabilizer measurement circuits, which incorporates flag qubits. We show how information from flag qubits can be used in an efficient and scalable way with the Restriction Decoder to maintain the effective distance of the code. We numerically estimate the threshold of the triangular color code to be 0.2%, which is competitive with the thresholds of other topological quantum codes. We also prove that 1-flag stabilizer measurement circuits are sufficient to preserve the full code distance, which may be used to find simpler syndrome extraction circuits of the color code.

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/ab68fd

Cites

54 of 54 references verified0 citation errors · 0 not checkable

Statistics

Figures

Image 1
CC-BY · From the PDF
Figure 2 Implementation of the triangular color code where syndrome measurement qubits ( red, blue and green circles ) , fl ag qubits ( yellow circles ) anddata qubits ( white circles ) have all degree three connectivity. All the qubits can be viewed as being located at the vertices of smaller hexagons ( showninred ) . The black edges between vertices represent physical connections between the qubits. The dashed edges do not represent any physical connections, and are simply included to highlight the two-dimensional lattice  .
Figure 2 Implementation of the triangular color code where syndrome measurement qubits ( red, blue and green circles ) , fl ag qubits ( yellow circles ) anddata qubits ( white circles ) have all degree three connectivity. All the qubits can be viewed as being located at the vertices of smaller hexagons ( showninred ) . The black edges between vertices represent physical connections between the qubits. The dashed edges do not represent any physical connections, and are simply included to highlight the two-dimensional lattice  .CC-BY · From the PDF
Figure 3 Circuits for measuring ( a ) weight-four and ( b ) weight-six Z -stabilizers of the triangular color code with minimal depth. The white circles correspond to data qubits, yellow circles to fl ag qubits and the dark circle to the ancilla qubits. Circuits for measuring the X -stabilizers can be obtained by reversing the direction of each CNOT gate, swapping +ñ ∣ and ñ 0 ∣ states and swapping X and Z measurements.
Figure 3 Circuits for measuring ( a ) weight-four and ( b ) weight-six Z -stabilizers of the triangular color code with minimal depth. The white circles correspond to data qubits, yellow circles to fl ag qubits and the dark circle to the ancilla qubits. Circuits for measuring the X -stabilizers can be obtained by reversing the direction of each CNOT gate, swapping +ñ ∣ and ñ 0 ∣ states and swapping X and Z measurements.CC-BY · From the PDF
Figure 4 Full CNOTgate scheduling for one round of X stabilizer measurements. Note that in order to minimize the total number of time steps, a different scheduling for the weight-four stabilizer measurements is used at the boundaries b 1 , b 2 and b 3 .
Figure 4 Full CNOTgate scheduling for one round of X stabilizer measurements. Note that in order to minimize the total number of time steps, a different scheduling for the weight-four stabilizer measurements is used at the boundaries b 1 , b 2 and b 3 .CC-BY · From the PDF
Figure 6 Flag edges added to the 2D lattice  * . In this example, the lattice  * showncorresponds to the d = 9 triangular color code where the fl ag f 1 fl agged ( belonging to the face i with ancilla vertex vi ) , resulting in the data qubit errors E E 1 2 . Note that this depiction of the lattice  * differs from previous illustrations, e.g. fi gure 1, by an af fi ne transformation.
Figure 6 Flag edges added to the 2D lattice  * . In this example, the lattice  * showncorresponds to the d = 9 triangular color code where the fl ag f 1 fl agged ( belonging to the face i with ancilla vertex vi ) , resulting in the data qubit errors E E 1 2 . Note that this depiction of the lattice  * differs from previous illustrations, e.g. fi gure 1, by an af fi ne transformation.CC-BY · From the PDF
Image 6
CC-BY · From the PDF
Figure 7 Flag edge and 2D edges belonging to D  1 * ( ) associated with the fl ag outcomes ( a ) f 1 , ( b ) f 2 and ( c ) f 3 for a given face i in  . As can be seen from fi gure 1, a weight-one data qubit error results in three highlighted edges in D  1 * ( ) . Hence the fl ag edges, in addition to edges for the possible weight-one data qubit errors, form the edges shaped as an arrow as seen in the fi gure and should be renormalized to edge weights with error probability  p ( ) in the presence of the corresponding fl ags. The same pattern is chosen for blue and red fl ag edges. If both fl ag qubits f 1 and f 3 fl ag ( which can only result in a weight-two data qubit error E E 1 2 ) , then only the fl ag edge in ( b ) should be renormalized to an edge weight with error probability  p ( ) .
Figure 7 Flag edge and 2D edges belonging to D  1 * ( ) associated with the fl ag outcomes ( a ) f 1 , ( b ) f 2 and ( c ) f 3 for a given face i in  . As can be seen from fi gure 1, a weight-one data qubit error results in three highlighted edges in D  1 * ( ) . Hence the fl ag edges, in addition to edges for the possible weight-one data qubit errors, form the edges shaped as an arrow as seen in the fi gure and should be renormalized to edge weights with error probability  p ( ) in the presence of the corresponding fl ags. The same pattern is chosen for blue and red fl ag edges. If both fl ag qubits f 1 and f 3 fl ag ( which can only result in a weight-two data qubit error E E 1 2 ) , then only the fl ag edge in ( b ) should be renormalized to an edge weight with error probability  p ( ) .CC-BY · From the PDF
Figure 8 Suppose that a single fault occurs during the weight-six Z stabilizer measurement resulting in the fl ag f 1 . From fi gure 5, it can be seen that the possible Z -type data qubit errors are I Z Z Z , , 1 1 2 { } . Applying the correction Z 1 immediately after the fl ag outcome guarantees that there can be at most a weight-one data qubit error.
Figure 8 Suppose that a single fault occurs during the weight-six Z stabilizer measurement resulting in the fl ag f 1 . From fi gure 5, it can be seen that the possible Z -type data qubit errors are I Z Z Z , , 1 1 2 { } . Applying the correction Z 1 immediately after the fl ag outcome guarantees that there can be at most a weight-one data qubit error.CC-BY · From the PDF
Figure 9 Logical Z error rates for the triangular color code af fl icted by code capacity noise, where each data qubit has an X , Y or Z Pauli error with probability p 3 each. Data qubit errors were corrected using the 2D decoder described in section 2. Since the decoder corrects both X and Z errors symmetrically, the plot for logical X errors is identical to the one shown above.
Figure 9 Logical Z error rates for the triangular color code af fl icted by code capacity noise, where each data qubit has an X , Y or Z Pauli error with probability p 3 each. Data qubit errors were corrected using the 2D decoder described in section 2. Since the decoder corrects both X and Z errors symmetrically, the plot for logical X errors is identical to the one shown above.CC-BY · From the PDF
Figure 10 ( a ) Logical X error rates and ( b ) logical Z error rates for the triangular color code af fl icted by the full circuit level noise model described in section 3.4. For both logical X and Z errors, the threshold is found to be = p 0.002 th .
Figure 10 ( a ) Logical X error rates and ( b ) logical Z error rates for the triangular color code af fl icted by the full circuit level noise model described in section 3.4. For both logical X and Z errors, the threshold is found to be = p 0.002 th .CC-BY · From the PDF
Figure 11 ( a ) Anaive generalization of the Restriction Decoder to the triangular color code would pair up restricted syndromes s RG and s RB ( marked vertices ) within two restricted lattices  RG * and  RB * , and apply the local lifting procedure to all vertices of color R , including the boundary vertex vR . Such a decoder is only guaranteed to correct errors of weight at most -d 3 4 ⎢ ⎣ ⎥ ⎦ , compared with -d 3 2 ⎢ ⎣ ⎥ ⎦ for the adapted Restriction Decoder. We illustrate examples of smallest weight errors ( circles shaded in gray ) leading to logical errors for ( a ) a naive generalization of the Restriction Decoder and ( b ) the adapted Restriction Decoder. ( c ) Theadapted Restriction Decoder successfully corrects the error, which in ( a ) led to a logical error when a naive generalization of the Restriction Decoder was used.
Figure 11 ( a ) Anaive generalization of the Restriction Decoder to the triangular color code would pair up restricted syndromes s RG and s RB ( marked vertices ) within two restricted lattices  RG * and  RB * , and apply the local lifting procedure to all vertices of color R , including the boundary vertex vR . Such a decoder is only guaranteed to correct errors of weight at most -d 3 4 ⎢ ⎣ ⎥ ⎦ , compared with -d 3 2 ⎢ ⎣ ⎥ ⎦ for the adapted Restriction Decoder. We illustrate examples of smallest weight errors ( circles shaded in gray ) leading to logical errors for ( a ) a naive generalization of the Restriction Decoder and ( b ) the adapted Restriction Decoder. ( c ) Theadapted Restriction Decoder successfully corrects the error, which in ( a ) led to a logical error when a naive generalization of the Restriction Decoder was used.CC-BY · From the PDF
Figure 12 In ( a ) , we show the connections between a red ancilla vertex, with blue and green vertices as would occur in the bulk of the triangular color code, with the layout shown in fi gure 4. In ( b ) , we label the edges representing connections between the red vertex with the blue and green vertices found in the full RGB matching graph.
Figure 12 In ( a ) , we show the connections between a red ancilla vertex, with blue and green vertices as would occur in the bulk of the triangular color code, with the layout shown in fi gure 4. In ( b ) , we label the edges representing connections between the red vertex with the blue and green vertices found in the full RGB matching graph.CC-BY · From the PDF
Figure 13 Diagonal edges eR and eG ( showninredandgreen ) connecting red and green vertices between measurement rounds j and + j 1 . If such an edge is chosen during MWPM, it will be projected to the edge e 5 whenperforming the fl attening on edges of  RG  .
Figure 13 Diagonal edges eR and eG ( showninredandgreen ) connecting red and green vertices between measurement rounds j and + j 1 . If such an edge is chosen during MWPM, it will be projected to the edge e 5 whenperforming the fl attening on edges of  RG  .CC-BY · From the PDF
Figure 14 Illustration of all 3D diagonal edges connecting two different 2D lattices for the matching graphs ( a )  RG  , ( b )  RB  ( c )  GB  . Note that the fl ag edges are not shown, and vertical edges are represented by dashed lines.
Figure 14 Illustration of all 3D diagonal edges connecting two different 2D lattices for the matching graphs ( a )  RG  , ( b )  RB  ( c )  GB  . Note that the fl ag edges are not shown, and vertical edges are represented by dashed lines.CC-BY · From the PDF
Figure 15 Edge labels for the ( a )  RG  , ( b )  RB  graph and ( c )  GB  graphs. Edges with identical labels have the same weights. Edges in the bulk with different weights are only labeled once since such patterns are repeated throughout the bulk.
Figure 15 Edge labels for the ( a )  RG  , ( b )  RB  graph and ( c )  GB  graphs. Edges with identical labels have the same weights. Edges in the bulk with different weights are only labeled once since such patterns are repeated throughout the bulk.CC-BY · From the PDF

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

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?

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 54 references

Research works printed but not linked: 1

  1. Wang, 2010, Graphical algorithms and threshold error rates for the 2d colour code, Quantum Inf. Comput., 10, 780

Cited by

See all 106

Metadata

Authors
Chamberland, C., Kubica, A., Yoder, T. J., & Zhu, G.
Affiliations
  • IBM Research - Thomas J. Watson Research Center (US)
  • University of Waterloo (CA)
Corresponding author
Chamberland, Christopher
Venue
New Journal of Physics
Published
2020-02-01
Volume
22
Issue
2
Pages
023019
ISSN
1367-2630 (ISSN-L)
OpenAlex
W2984245858
Cited by
105
References
56
Citations by year
2026: 4 · 2025: 14 · 2024: 22 · 2023: 17 · 2022: 17 · 2021: 19 · 2020: 12
FWCI
6.38
Type
journal article
Language
en
Open access
Licence
Locations
  • New Journal of Physics (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
Funders
Intelligence Advanced Research Projects Activity (W911NF-16-0114)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
topological quantum error correction, depolarizing noise, syndrome extraction, code distance, cubic graphs, superconducting qubits, fault-tolerant quantum computing

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: Triangular color codes on trivalent graphs with flag qubits. https://app.cochat.ai/papers/10.1088/1367-2630/ab68fd
The paper
Chamberland, C., Kubica, A., Yoder, T. J., & Zhu, G. (2020). Triangular color codes on trivalent graphs with flag qubits. New Journal of Physics. https://doi.org/10.1088/1367-2630/ab68fd

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.