Koki Okada, Kenta Kasai (Jun 26 2026).
Abstract: We construct a rate-
2/3 quantum low-density parity-check (LDPC) code from a
(3,18)-regular two-branch finite-field base and a circulant-permutation-matrix (CPM) lift of degree
P=101. The resulting code is a Calderbank-Shor-Steane (CSS) code with parameters
[[34542,23032,d≤310]]. We do not regard this upper bound as an estimate of the true minimum distance; rather,
d≤310 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
HX​ and
HZ​ separately have girth 8. Decoder experiments with log-likelihood-ratio (LLR) joint belief propagation (BP) and deterministic post-processing show no failures in
108 trials at
p=0.01, and a finite-length frame error rate (FER) sweep estimates the transition near
p=0.029.