Square homological product code [1]
Description
Homological product code whose underlying quantum-code boundary operators are square matrices (see Qubit CSS-to-homology correspondence).
Each base code is associated with the chain complex \( C_i \longrightarrow C_i\longrightarrow C_i\) such that the boundary operator (a.k.a. parity-check matrix) satisfies \(H_i^{2}=0\) [2; Def. 3.8]. The parity-check matrix of the resulting product code is \begin{align}
Protection
The product of two codes \([[n_i,k_i]]\) is an \([[n_1 n_2,k_1 k_2]]\) code [1; Sec. II.B]. Its \(X\)-type and \(Z\)-type distances satisfy \(\max(d_1^{\alpha},d_2^{\alpha})\leq d^{\alpha}\leq d_1^{\alpha}d_2^{\alpha}\) for \(\alpha\in\{X,Z\}\) [1; Lemma 2]. The product of two random codes of length \(M\) and dimension \(\rho M\) has distance \(\Omega(M^2)\) with high probability for small enough \(\rho>0\) [1; Thm. 3]. This yields a family of \([[n,\Theta(n),\Theta(n)]]\) codes with stabilizer weight \(O(\sqrt{n})\) [1; Thm. 1]. Square homological-product codes admit different properties than those with rectangular boundary operators [2; Sec. 3.4].Primary Hierarchy
References
- [1]
S. Bravyi and M. B. Hastings, “Homological Product Codes”, (2013) arXiv:1311.0885
- [2]
B. Audoux and A. Couvreur, “On tensor products of CSS Codes”, (2018) arXiv:1512.07081
Page edit log
- Victor V. Albert (2026-09-24) — most recent
- Victor V. Albert (2026-06-08)
- Victor V. Albert (2025-03-03)
Cite as:
“Square homological product code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/square_homological_product, arXiv:2606.11484