We construct a rate- quantum low-density parity-check (LDPC) code from a -regular two-branch finite-field base and a circulant-permutation-matrix (CPM) lift of degree . The resulting code is a Calderbank-Shor-Steane (CSS) code with parameters . We do not regard this upper bound as an estimate of the true minimum distance; rather, is the tightest upper bound currently obtained from structural lifts and decoder-produced logical errors. The construction has row weight 18 and column weight 3, and the Tanner graphs of and separately have girth 8. Decoder experiments with log-likelihood-ratio (LLR) joint belief propagation (BP) and deterministic post-processing show no failures in trials at , and a finite-length frame error rate (FER) sweep estimates the transition near .

生成讲解博客的中文版本

生成AI智能校验的中文版本