# Haah cubic code[1]

## Description

Class of stabilizer codes on a length-\(L\) cubic lattice with one or two qubits per site. We also require that the stabilizer group \(\mathsf{S}\) is translation invariant and generated by two types of operators with support on a cube.

In the non-CSS case, these two are related by spatial inversion. For CSS codes, we require that the product of all corner operators is the identity. We lastly require that there are no non-trival ''string operators'', meaning that single-site operators are a phase, and any period one logical operator \(l \in \mathsf{S}^{\perp}\) is just a phase.

Haah showed in his original construction that there is exactly one non-CSS code of this form, and 17 CSS codes [1]. The non-CSS code is labeled code 0, and the rest are numbered from 1 - 17. Codes 1-4, 7, 8, and 10 do not have string logical operators [1,2]. Encodings using geometries with boundaries as well as lattice defects have been studied [3].

## Protection

## Threshold

## Parents

## Cousins

- Three-dimensional color code — The 3D color and cubic code families both include 3D codes that do not admit string-like operators.
- Homological code — The energy of any partial implementation of Haah cubic code 1 is proportional to the boundary length similar to the 4D toric code, which can potentially surpress the effects of thermal errors, but it is currently an open problem.
- Generalized bicycle (GB) code — A GB code for the group \(G=\mathbb{Z}_3^{\times 3}\) is the cubic code [4; Sec. III.A].
- Lifted-product (LP) code — A lifted-product code constructed with coefficients in the ring \(R=\mathbb{F}_2[x,y,z]/(x^L-1,y^L-1,z^L-1)\) is the cubic code [5; Appx. B].
- Fibonacci code — The Fibonacci code is designed to mimic the fractal properties of (quantum) Haah cubic code so that studying the former can help us toward the development of an efficient algorithm for the latter [6].
- Self-correcting quantum code — Cubic code 1 is partially self-correcting with a logarithmic energy barrier [7].

## References

- [1]
- J. Haah, “Local stabilizer codes in three dimensions without string logical operators”, Physical Review A 83, (2011) arXiv:1101.1962 DOI
- [2]
- A. Dua et al., “Sorting topological stabilizer models in three dimensions”, Physical Review B 100, (2019) arXiv:1908.08049 DOI
- [3]
- C. T. Aitchison et al., “No Strings Attached: Boundaries and Defects in the Cubic Code”, (2023) arXiv:2308.00138
- [4]
- P. Panteleev and G. Kalachev, “Quantum LDPC Codes With Almost Linear Minimum Distance”, IEEE Transactions on Information Theory 68, 213 (2022) arXiv:2012.04068 DOI
- [5]
- P. Panteleev and G. Kalachev, “Asymptotically Good Quantum and Locally Testable Classical LDPC Codes”, (2022) arXiv:2111.03654
- [6]
- G. M. Nixon and B. J. Brown, “Correcting Spanning Errors With a Fractal Code”, IEEE Transactions on Information Theory 67, 4504 (2021) arXiv:2002.11738 DOI
- [7]
- S. Bravyi and J. Haah, “Quantum Self-Correction in the 3D Cubic Code Model”, Physical Review Letters 111, (2013) arXiv:1112.3252 DOI

## Page edit log

- Victor V. Albert (2022-01-11) — most recent
- Siddharth Taneja (2021-12-19)

## Cite as:

“Haah cubic code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/haah_cubic