Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts

Published 25 Jun 2026 in quant-ph and cs.IT | (2606.27130v1)

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 construction has row weight 18 and column weight 3, and the Tanner graphs of $H_X$ and $H_Z$ 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$.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.