A protograph-tied neural belief-propagation decoder in which the learned message weights are shared per protograph-edge group, so the parameter count is independent of the quasi-cyclic lift factor, and a semi-quantum protograph-EXIT screening framework that tracks dual X/Z scalar-information trajectories under depolarizing noise are developed.
Abstract
Quantum low-density parity-check (QLDPC) codes need decoders reusable across a code family and design tools that predict finite-length performance cheaply. We address both for protograph CSS codes. First, we propose a protograph-tied neural belief-propagation decoder in which the learned message weights are shared per protograph-edge group, so the parameter count is independent of the quasi-cyclic lift factor. A single pair of axis decoders, with 132 active weights per axis, is trained once on the smallest member of a code family and deployed without retraining across a four-fold range of blocklengths, staying within a factor of 1.42–1.54 of the BP+OSD-0 reference for the lift factors of the single base matrix studied here. Second, we develop a semi-quantum protograph-EXIT (P-EXIT) screening framework that tracks dual X/Z scalar-information trajectories under depolarizing noise. Its hashing-bound-calibrated thresholds provide an inexpensive screening score, and we test whether that score is a useful co-design objective. In the tested short-blocklength setting it is not: at matched rate and blocklength, candidates with an eight-fold threshold advantage lose to a low-threshold baseline, and gating the objective by Tanner girth and an estimated distance does not repair it; the sole strict Pareto-improver still fails to beat it. The cause is that neither the threshold nor the base-graph gate sees lift-specific short cycles and distance losses. A screen of 240 circulant lifts per lift factor finds 15–31% operationally failing lifts, indistinguishable from working lifts in blocklength, rate, rank and degree. For the separate post-lift structural measurements available on 40 seeds per lift factor, the observed failures and working cases are separated by girth and an estimated distance. Together they give a scale-transferable quantum decoder and an account of why threshold-guided co-design fails at short blocklength.
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
A parallel decoder for quantum low-density parity-check codes based on probabilistic bits (p-bits), tunable stochastic binary units controlled by local fields, which establishes constraint-annealed p-bit dynamics as a competitive stochastic alternative for QLDPC decoding and motivate further study of hardware-native im...
Mert Gökduman, Cyril Guyot, H. Pfister· 0 citations
Quantum low-density parity-check (QLDPC) codes are promising candidates for low-overhead fault-tolerant quantum computation, but their practical use requires fast, low-complexity, and reliable decoders. Belief propagation (BP) is attractive because of its local message-passing structure, yet standard flooding BP often...
Mohsen Moradi, Taejoon Kim, Re-Mi A. Chou· 0 citations
This work treats degenerate decoding as probabilistic inference in an undirected graphical model: the probability of each logical class is the partition function of an unconstrained, strictly positive Markov random field over the code's check variables, a construction that generalizes the random-bond Ising mapping of t...
R. Krishnamoorthy, Florian Gerhardt, Johannes Knaute et al.· 2 citations· ⚡1
Results connect parallel BP post-processing to lower decoding costs and earlier correction release in streaming quantum memory to connect parallel BP post-processing to lower decoding costs and earlier correction release in streaming quantum memory.
Near-memory processing can provide high aggregate throughput and sub-millisecond compute latency for qLDPC BP decoding under the evaluated conditions, and shows that near-memory processing can provide high aggregate throughput and sub-millisecond compute latency for qLDPC BP decoding under the evaluated conditions.
Jeong-mae Seo, Youngsun Han, Leanghok Hour et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.