Permutationally decodable CSS quantum codes
Massinissa Zenia, Yannick Saouter, Gilles Burel, Roland Gautier
Abstract
Quantum error-correcting codes are essential for protecting quantum information against decoherence. This work investigates the construction of quantum CSS codes from classical self-orthogonal binary linear codes derived from extended quadratic residue codes. By exploiting the large automorphism groups of these codes, the minimum-weight codewords are partitioned according to the action of maximal subgroups of the automorphism group. Codes generated from these partitions are shown to be self-orthogonal and to retain large automorphism groups, allowing the construction of associated quantum CSS codes with good parameters. The resulting codes include new quantum codes with lengths ranging from 16 to 48 and minimum distances up to 11. Their automorphism groups and permutation-decoding properties are also analyzed, including the number of permutations required for complete decoding. The results provide new families of quantum CSS codes combining good error-correcting parameters, large automorphism groups, and efficient permutation decoding.