High-Girth Regular Quantum LDPC Codes from Affine-Coset Structures
Abstract
We construct a quantum low-density parity-check code family from a length-512 Calderbank-Shor-Steane base matrix pair. The base pair is $(3,8)$-regular, both Tanner graphs have girth 8 , and the base code has parameters $[[512,174,8]]$. The construction uses affine cosets of six 3-dimensional subspaces of $\mathbb{F}_2^9$ as check supports, and then applies circulant permutation matrix (CPM) lifts. The main decoding experiment uses the CPM-lifted code with lift factor $P=32$, which has parameter...
Description / Details
We construct a quantum low-density parity-check code family from a length-512 Calderbank-Shor-Steane base matrix pair. The base pair is -regular, both Tanner graphs have girth 8 , and the base code has parameters . The construction uses affine cosets of six 3-dimensional subspaces of as check supports, and then applies circulant permutation matrix (CPM) lifts. The main decoding experiment uses the CPM-lifted code with lift factor , which has parameters , under the code-capacity depolarizing model. A belief-propagation decoder with post-processing achieved frame error rate about at 0.085 , and one observed logical residual of weight 40 gives a decoder-derived upper bound .
Source: arXiv:2604.20838v1 - http://arxiv.org/abs/2604.20838v1 PDF: https://arxiv.org/pdf/2604.20838v1 Original Link: http://arxiv.org/abs/2604.20838v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Apr 23, 2026
Quantum Computing
Quantum Physics
0