Improved belief propagation is sufficient for real-time decoding of quantum memory
Abstract
We introduce a new heuristic decoder, Relay-BP, targeting real-time quantum circuit decoding for large-scale quantum computers. Relay-BP achieves high accuracy across circuit-noise decoding problems: significantly outperforming BP+OSD+CS-10 for bivariate-bicycle codes and comparable to min-weight-matching for surface codes. As a lightweight message-passing decoder, Relay-BP is inherently parallel, enabling rapid low-footprint decoding with FPGA or ASIC real-time implementations, similar to standard BP. A core aspect of our decoder is its enhancement of the standard BP algorithm by incorporating disordered memory strengths. This dampens oscillations and breaks symmetries that trap traditional BP algorithms. By dynamically adjusting memory strengths in a relay approach, Relay-BP can consecutively encounter multiple valid corrections to improve decoding accuracy. We observe that a problem-dependent distribution of memory strengths that includes negative values is indispensable for good performance.
Keywords
Cite
@article{arxiv.2506.01779,
title = {Improved belief propagation is sufficient for real-time decoding of quantum memory},
author = {Tristan Müller and Thomas Alexander and Michael E. Beverland and Markus Bühler and Blake R. Johnson and Thilo Maurer and Drew Vandeth},
journal= {arXiv preprint arXiv:2506.01779},
year = {2025}
}
Comments
8 pages, 1 Table, 5 Figures, 1 Algorithm; v2: Added citations, fixed a typo in fig. 4