aiqbench analysis
This study presents a novel construction of rate-2/3 quantum LDPC codes using two-branch finite-field bases and CPM lifts, achieving parameters [[34542, 23032, 18]]. The work combines rigorous computer-assisted proofs for distance bounds with decoder experiments demonstrating robustness against bit-flip errors in joint belief propagation schemes. These advances directly address the need for scalable, high-distance error correction architectures essential for fault-tolerant quantum computing.
Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts
arXiv:2606.27130v2 Announce Type: replace 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,18]]$. Its distance is established by a computer-assisted proof: an explicit nontrivial logical operator gives the upper bound, and a complete symmetry-reduced enumeration excludes every nonzero vector of weight below 18 in both parity-check kernels. We also prove that every affine-in-$t$ CPM lift of the same base satisfying CSS orthogonality has distance at most 18 for every prime lift degree $P>19$. 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 $10^8$ trials at $p=0.01$, and a finite-length frame error rate (FER) sweep estimates the transition near $p=0.029$.
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,18]]$. Its distance is established by a computer-assisted proof: an explicit nontrivial logical operator gives the upper bound, and a complete symmetry-reduced enumeration excludes every nonzero vector of weight below 18 in both parity-check kernels. We also prove that every affine-in-$t$ CPM lift of the same base satisfying CSS orthogonality has distance at most 18 for every prime lift degree $P>19$. 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 $10^8$ trials at $p=0.01$, and a finite-length frame error rate (FER) sweep estimates the transition near $p=0.029$.
Quantum Physics (quant-ph); Information Theory (cs.IT)
arXiv:2606.27130 [quant-ph]
(or arXiv:2606.27130v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2606.27130 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 244 words
Related coverage

Breaking the Orthogonality Barrier in Quantum LDPC Codes
Quantum Journal · Sep 9, 2026
A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases
arXiv · Aug 17, 2026

Quantum codes sidestep a key limit on error correction
Quantum Zeitgeist · Sep 9, 2026

Bringing Classical LDPC Code Design Theory to Quantum Computers
The Quantum Insider · Sep 9, 2026