Description
Galois-qudit CSS code constructed from three pairwise commuting square matrices \(A\), \(B\), and \(C\); the case \(t=3\) of multi-block CSS codes. The four-term chain complex underlying the code provides a complete set of metachecks in one basis, given by explicit closed-form check matrices.
The complex \(
For qubit codes, minus signs can be dropped, and the level-one code can be written as [2] \begin{align}
Cousins
- Two-block CSS code— Three-block (two-block) CSS codes are constructed from three (two) commuting square matrices.
- XYZ product code— The XYZ product yields non-CSS codes from a three-fold product of three classical codes, while three-block CSS codes arise from a three-fold product of two-term chain complexes defined by three commuting square matrices.
Member of code lists
Primary Hierarchy
References
- [1]
H.-K. Lin, P. K. Lim, A. A. Kovalev, and L. P. Pryadko, “Abelian multi-cycle codes for single-shot error correction”, (2026) arXiv:2506.16910
- [2]
V. Menon, J. P. Bonilla Ataides, R. Mehta, A. Gu, D. B. Tan, and M. D. Lukin, “Magic Tricycles: Efficient Magic-State Generation with Finite Block-Length Quantum LDPC Codes”, Physical Review X 16, (2026) arXiv:2508.10714 DOI
- [3]
A. Jacob, C. McLauchlan, and D. E. Browne, “Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes”, (2026) arXiv:2508.08191
Page edit log
- Victor V. Albert (2026-07-18) — most recent
Cite as:
“Three-block CSS code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/three_block_quantum, arXiv:2606.11484