We study two explicit constructions of binary Calderbank--Shor--Steane quantum low-density parity-check (QLDPC) codes with check weight six. The first uses a fixed circulant shift pattern and yields parameters $\code{6N}{2N+2}{6}$ with Tanner graph girth twelve for $N=31$ and every $N\ge37$. A graph incidence interpret...
V. Nourozi, R. Smarandache, David G. M. Mitchell· 0 citations
Belief propagation (BP) is attractive for quantum low-density parity-check (QLDPC) decoding because of its low complexity and low latency, but short cycles and degeneracy can limit its error-correction performance. Reinforcement-learned sequential scheduling (RL-S) substantially improves this performance by adapting th...
Mohsen Moradi, Ghilas Aissou, Taejoon Kim et al.· 1 citation
We construct quantum codes from codewords of a cyclic code and the minors of a polynomial matrix. The construction uses a two-row, three-column matrix whose minors yield a second matrix satisfying the CSS orthogonality condition. We derive the code dimension from the greatest common divisors of the entries and minors,...
V. Nourozi, R. Smarandache, David G. M. Mitchell· 0 citations
This work proposes RL-MBOSD, a reinforcement-learning-guided multi-branch decoder for QLDPC codes, which gives lower error-rate point estimates than the re-plotted prior baselines.
V. Nourozi, T. Koike-Akino, David G. M. Mitchell· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.