Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts
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\le 310]]$. We do not regard this upper bound as an estimate of the true minimum distance; rather, $d\le310$ is the tightest upper bound currently obtained from structural lifts and decoder-produced logical errors. The co...
Description / Details
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 .
Source: arXiv:2606.27130v1 - http://arxiv.org/abs/2606.27130v1 PDF: https://arxiv.org/pdf/2606.27130v1 Original Link: http://arxiv.org/abs/2606.27130v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Jun 26, 2026
Quantum Computing
Quantum Physics
0