Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research presents high-girth regular quantum LDPC codes derived from affine-coset structures, demonstrating improved decoding performance via belief-propagation algorithms on large-scale lifted instances. The study provides a direct proof of graph regularity and girth properties for specific Calderbank-Shor-Steane base pairs while validating error correction capabilities under depolarizing noise models.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

High-Girth Regular Quantum LDPC Codes from Affine-Coset Structures

arXiv2 min read

arXiv:2604.20838v3 Announce Type: replace Abstract: We construct a quantum low-density parity-check code family from a length-$512$ Calderbank--Shor--Steane base matrix pair. The base pair is permutation-equivalent to the known SPC(3) product CSS code, and the present affine-coset description gives a direct proof that both Tanner graphs are $(3,8)$-regular with girth $8$. The base code has parameters $[[512,174,8]]$. We then apply circulant permutation matrix (CPM) lifts. The main decoding experiment uses the CPM-lifted code with lift factor $P=32$, which has parameters $[[16384,4142,\le 32]]$, under the code-capacity depolarizing model. Explicit weight-$32$ non-stabilizer logical representatives on both the $X$ and $Z$ sides give $d_X,d_Z\le32$. A belief-propagation decoder with post-processing achieved frame error rate about $10^{-8}$ at $p=0.085$; an independently observed logical residual of weight $40$ is consistent with the sharper structural bound.

Abstract:We construct a quantum low-density parity-check code family from a length-$512$ Calderbank--Shor--Steane base matrix pair. The base pair is permutation-equivalent to the known SPC(3) product CSS code, and the present affine-coset description gives a direct proof that both Tanner graphs are $(3,8)$-regular with girth $8$. The base code has parameters $[[512,174,8]]$. We then apply circulant permutation matrix (CPM) lifts. The main decoding experiment uses the CPM-lifted code with lift factor $P=32$, which has parameters $[[16384,4142,\le 32]]$, under the code-capacity depolarizing model. Explicit weight-$32$ non-stabilizer logical representatives on both the $X$ and $Z$ sides give $d_X,d_Z\le32$. A belief-propagation decoder with post-processing achieved frame error rate about $10^{-8}$ at $p=0.085$; an independently observed logical residual of weight $40$ is consistent with the sharper structural bound.

arXiv:2604.20838 [quant-ph]

(or arXiv:2604.20838v3 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2604.20838 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 · 212 words

Related coverage