[Jump to code hierarchy]

Color code[1,2]

Description

Member of a family of qubit CSS codes defined on particular \(D\)-dimensional graphs.

One family is defined on a \(D\)-dimensional graph which satisfies two properties: (1) the graph is a homogeneous simplicial \(D\)-complex obtained as a triangulation of the interior of a \(D\)-simplex, and (2) the graph is \(D+1\)-colorable. Qubits are placed on the \(D\)-simplices and generators are supported on suitable simplices [3–5]. Admissible graphs can be obtained via a fattening procedure [2]. See also a construction based on the more general quantum pin codes [6].

Protection

As with the surface code, the code distance depends on the specific kind of lattice used to define the code. More precisely, the distance depends on the homology of logical string operators [3].

Transversal Gates

Some color codes on \(D\)-dimensional lattices can transversally implement a gate at the \((D-1)\)st level of the Clifford hierarchy in the form of a \(Z\)-rotation by angle \(-\pi/2^D\) [4; Fig. 3].

Decoding

In contrast to the surface code, the color code can suffer from unremovable hook errors due to the specifics of its syndrome extraction circuits. Fault-tolerant decoders thus have to utilize additional flag qubits.

Fault Tolerance

The 6D color code is a self-correcting quantum memory and admits fault-tolerant universal gate set in 7D [7].

Notes

See Ref. [3] for an overview of color codes.

Cousins

  • Homological code— The color code on a \(D\)-dimensional closed manifold is equivalent to multiple decoupled copies of the \(D\)-dimensional surface code via a local constant-depth Clifford circuit [8–10]. This process can be viewed as an ungauging [11–20] of certain symmetries. Several hybrid color-surface codes exist [21,22].
  • Self-correcting quantum code— The 6D color code is a self-correcting quantum memory and admits fault-tolerant universal gate set in 7D [7].
  • Sarvepalli-Brown subsystem code— Sarvepalli-Brown subsystem codes can be derived from color codes [23; Thm. 3].
  • Subsystem color code

Member of code lists

Primary Hierarchy

Quantum Domain
Qubit Kingdom
Qubit codeQECC Quantum
Union stabilizer (USt) codeQECC Quantum
Qubit stabilizer codeStabilizer Hamiltonian-based Qubit QECC Quantum
Coherent-parity-check (CPC) code
Qubit CSS codeCSS Stabilizer Hamiltonian-based QECC Quantum
Generalized homological-product qubit CSS codeGeneralized homological-product QLDPC CSS Stabilizer Hamiltonian-based QECC Quantum
Quantum rainbow code
Quantum pin codeStabilizer Hamiltonian-based Qubit QECC Quantum
Parents
Quantum pin code
Color codes are special cases of quantum pin codes [6; Sec. II.E]
Color code
Children
\([[2^r-1,1,3]]\) simplex code
Each \([[2^r-1,1,3]]\) simplex code is a color code defined on a simplex in \(r-1\) dimensions [24,25].
2D color code
3D color code
Ball color code
Hyperbolic color code
Quasi-hyperbolic color code
\([[16,6,4]]\) Tesseract color code

References

[1]
H. Bombin and M. A. Martin-Delgado, “Topological Quantum Distillation”, Physical Review Letters 97, (2006) arXiv:quant-ph/0605138 DOI
[2]
H. Bombin and M. A. Martin-Delgado, “Exact topological quantum order inD=3and beyond: Branyons and brane-net condensates”, Physical Review B 75, (2007) arXiv:cond-mat/0607736 DOI
[3]
H. Bombin, “An Introduction to Topological Quantum Codes”, (2013) arXiv:1311.0277
[4]
A. Kubica and M. E. Beverland, “Universal transversal gates with color codes: A simplified approach”, Physical Review A 91, (2015) arXiv:1410.0069 DOI
[5]
A. M. Kubica, The ABCs of the Color Code: A Study of Topological Quantum Codes as Toy Models for Fault-Tolerant Quantum Computation and Quantum Phases Of Matter, California Institute of Technology, 2018 DOI
[6]
C. Vuillot and N. P. Breuckmann, “Quantum Pin Codes”, IEEE Transactions on Information Theory 68, 5955 (2022) arXiv:1906.11394 DOI
[7]
H. Bombin, R. W. Chhajlany, M. Horodecki, and M. A. Martin-Delgado, “Self-Correcting Quantum Computers”, (2012) arXiv:0907.5228
[8]
B. Yoshida, “Classification of quantum phases and topology of logical operators in an exactly solved model of quantum codes”, Annals of Physics 326, 15 (2011) arXiv:1007.4601 DOI
[9]
A. Kubica, B. Yoshida, and F. Pastawski, “Unfolding the color code”, New Journal of Physics 17, 083026 (2015) arXiv:1503.02065 DOI
[10]
A. B. Aloshious, A. N. Bhagoji, and P. K. Sarvepalli, “On the Local Equivalence of 2D Color Codes and Surface Codes with Applications”, (2018) arXiv:1804.00866
[11]
M. Levin and Z.-C. Gu, “Braiding statistics approach to symmetry-protected topological phases”, Physical Review B 86, (2012) arXiv:1202.3120 DOI
[12]
J. Haegeman, K. Van Acoleyen, N. Schuch, J. I. Cirac, and F. Verstraete, “Gauging Quantum States: From Global to Local Symmetries in Many-Body Systems”, Physical Review X 5, (2015) arXiv:1407.1025 DOI
[13]
S. Vijay, J. Haah, and L. Fu, “Fracton topological order, generalized lattice gauge theory, and duality”, Physical Review B 94, (2016) arXiv:1603.04442 DOI
[14]
D. J. Williamson, “Fractal symmetries: Ungauging the cubic code”, Physical Review B 94, (2016) arXiv:1603.05182 DOI
[15]
L. Bhardwaj, D. Gaiotto, and A. Kapustin, “State sum constructions of spin-TFTs and string net constructions of fermionic phases of matter”, Journal of High Energy Physics 2017, (2017) arXiv:1605.01640 DOI
[16]
A. Kubica and B. Yoshida, “Ungauging quantum error-correcting codes”, (2018) arXiv:1805.01836
[17]
W. Shirley, K. Slagle, and X. Chen, “Foliated fracton order from gauging subsystem symmetries”, SciPost Physics 6, (2019) arXiv:1806.08679 DOI
[18]
K. Dolev, V. Calvera, S. S. Cree, and D. J. Williamson, “Gauging the bulk: generalized gauging maps and holographic codes”, Journal of High Energy Physics 2022, (2022) arXiv:2108.11402 DOI
[19]
T. Rakovszky and V. Khemani, “The Physics of (good) LDPC Codes I. Gauging and dualities”, (2023) arXiv:2310.16032
[20]
D. J. Williamson and T. J. Yoder, “Low-overhead fault-tolerant quantum computation by gauging logical operators”, (2024) arXiv:2410.02213
[21]
M. Vasmer and A. Kubica, “Morphing Quantum Codes”, PRX Quantum 3, (2022) arXiv:2112.01446 DOI
[22]
N. Shutty and C. Chamberland, “Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories”, Physical Review Applied 18, (2022) arXiv:2201.12450 DOI
[23]
P. Sarvepalli and K. R. Brown, “Topological subsystem codes from graphs and hypergraphs”, Physical Review A 86, (2012) arXiv:1207.0479 DOI
[24]
H. Bombin, “Gauge Color Codes: Optimal Transversal Gates and Gauge Fixing in Topological Stabilizer Codes”, (2015) arXiv:1311.0879
[25]
B. J. Brown, N. H. Nickerson, and D. E. Browne, “Fault-tolerant error correction with the gauge color code”, Nature Communications 7, (2016) arXiv:1503.08217 DOI
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: color

Cite as:
“Color code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/color
BibTeX:
@incollection{eczoo_color, title={Color code}, booktitle={The Error Correction Zoo}, year={2023}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/color} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/color

Cite as:

“Color code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/color

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qubits/stabilizer/topological/color/color.yml.