Back to News
quantum-computing

Multistage Rewinding Decoder for QLDPC Codes

Milad Taghipour, Dimitris Chytas, Bane Vasi\'{c}
Loading...
4 min read
0 likes
⚡ Quantum Brief
Researchers Milad Taghipour, Dimitris Chytas, and Bane Vasić introduced a multistage rewinding decoder for quantum low-density parity-check codes, addressing key failure modes like classical trapping sets and degenerate errors. Their approach uses a heuristic metric combining log likelihood reliabilities, hard-decision oscillations, unsatisfied checks, and soft information to identify unreliable nodes. The decoder then selectively forces initial log likelihood ratios of suspicious nodes and restarts message-passing under guided configurations, managed via a beam-search framework with pruning based on residual syndrome weight and output reliability. Logical error rate results show it outperforms normalized min-sum decoding and matches belief propagation enhanced by order-10 ordered statistics.
Why it matters

This decoder advances fault-tolerant quantum computing by mitigating persistent error sources in QLDPC codes, offering a scalable, high-performance alternative to computationally intensive methods without sacrificing reliability.

AI Audio Summary
0:00 / 0:00
Click to play
page-006-object-011.webp
Quantum News · Media Library

Quantum Physics arXiv:2608.07783 (quant-ph) [Submitted on 7 Aug 2026] Title:Multistage Rewinding Decoder for QLDPC Codes Authors:Milad Taghipour, Dimitris Chytas, Bane Vasić View a PDF of the paper titled Multistage Rewinding Decoder for QLDPC Codes, by Milad Taghipour and 2 other authors View PDF HTML (experimental) Abstract:In this paper, we propose a multistage decoding framework that leverages internal information produced by an underlying message-passing decoder. The proposed method targets the failure dynamics caused by both classical trapping sets and degenerate errors supported on symmetric stabilizers, which are among the primary limitations of iterative decoding for QLDPC codes. To identify unreliable variable nodes, we introduce a heuristic metric that combines several dynamical features of the decoder, including variable-node log likelihood reliabilities, hard-decision oscillations, the number of adjacent unsatisfied checks, and the soft information contributed by unsatisfied checks. Based on this ranking metric, the decoder performs guided rewinds by selectively forcing the initial log likelihood ratio values of the most suspicious variable nodes and restarting the message-passing decoder under the corresponding forced configuration. To manage the combinatorial growth of candidate configurations, the search is formulated within a beam- search framework with controlled beam width. In addition, we introduce a pruning metric based on the combination of the residual syndrome weight and a posteriori reliability of the decoder output, thereby retaining only the most promising search paths. Logical error rate results demonstrate that the proposed decoder significantly outperforms the normalized min- sum decoder and achieves competitive performance with belief propagation enhanced by order-10 ordered statistics decoding. Comments: Subjects: Quantum Physics (quant-ph); Information Theory (cs.IT) Cite as: arXiv:2608.07783 [quant-ph] (or arXiv:2608.07783v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2608.07783 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Dimitris Chytas [view email] [v1] Fri, 7 Aug 2026 22:06:41 UTC (122 KB) Full-text links: Access Paper: View a PDF of the paper titled Multistage Rewinding Decoder for QLDPC Codes, by Milad Taghipour and 2 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-08 Change to browse by: cs cs.IT math math.IT References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-investment

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.