Resgru, a lightweight recurrent neural decoder that maps time-ordered detection events to a binary logical-class prediction for each shot, is proposed, a lightweight recurrent neural decoder that maps time-ordered detection events to a binary logical-class prediction for each shot.
Abstract
Decoding is a central bottleneck in near-term quantum error correction (QEC), where repeated syndrome extraction must be translated into reliable logical outcomes under realistic noise and hardware constraints. We study heavy-hexagon (HH) quantum memory experiments and propose Resgru, a lightweight recurrent neural decoder that maps time-ordered detection events to a binary logical-class prediction for each shot. We benchmark Resgru against a standard minimum-weight perfect matching (MWPM) decoder instantiated on the same detector error model for HH code at code distances d∈{3,5,7} under circuit-level depolarizing noise with physical error rate p=0.1%. Resgru consistently achieved higher logical fidelity than MWPM decoder and yields lower per-round logical error rates, including a 28% reduction for d=5 and a 14% reduction for d=7. Despite being trained only on short sequences, Resgru maintains an advantage when evaluated on longer simulated memory experiments up to 300 QEC rounds.
QAdapt is presented, a noise-adaptive neural pre-decoding framework for surface-code quantum error correction that captures local spatiotemporal correlations in syndrome data, sequentially adapting to evolving noise conditions while mitigating catastrophic forgetting, and forwards the residual syndrome to a conventiona...
Ran Miao, Rui Luo, Xiaohan Shan et al.· arXiv.org· 0 citations
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
Quantum error correction can be enhanced by post-selecting out runs that are likely to produce a logical failure, but the most accurate measures for that require costly decoder-level information. We introduce a practical, decoder-agnostic post-selection method that learns directly from syndrome data. The method trains...
An adaptive confidence-gated decoding framework for the rotated surface code that treats decoding as a two-stage inference problem that improves logical accuracy and confidence-controlled accuracy-latency trade-offs, decoding throughput, per-shot latency, and decoding-graph resource scaling is presented.
Inspired by recent affine-permutation-based code constructions and the long-range connectivity available in reconfigurable neutral-atom arrays, Cornucopia codes are introduced, a family of practical, hardware-efficient quantum low-density parity-check codes that achieve an ultra-high encoding rate exceeding $1/2 while...
This chapter surveys ML-based methods for quantum error decoding, with a focus on topological codes and an emphasis on architectural principles, practical performance, and real-time considerations.
Changwon Lee, Tak Hur, Jeongwoo Jae 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.