Hypergraph product codes
2026-09-27 - Thorsten Hehn
We are now looking for a first example code to run our CSS-type simulations with. It shall fulfill the commuting condition and have longer code length than the simple 3-qubit / 11-qubit examples we used until now.
Hypergraph product codes were first introduced by Tillich and Zémor [1] in
2014. They are constructed to fulfill the commuting condition by
design. Suppose two classical block codes with parity check matrix
H_1 of size m_1 \times n_1 and H_2 of size m_2 \times n_2. From this, two larger parity-check matrices H_X and H_Z are
constructed, to account for Z-errors and X-errors, respectively.