Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices

Quantum error correcting codes are essential to achieve fault-tolerant quantum computation.

This work introduces two constructions of high-rate, dual-containing (DC) Calderbank--Shor--Steane low-density parity-check (LDPC) codes based on quasi-dyadic matrices.

We characterize the automorphism group of such codes, investigate their minimum distance behavior, and provide several theoretical results on their cycle properties.

Monte Carlo simulations under depolarizing and phenomenological noise show better finite-length logical error rates than the considered DC benchmark codes and competitive performance against several state-of-the-art quantum LDPC code families.

Finally, we employ an automorphism-ensemble belief propagation decoder to improve their decoding performance.