Researchers have developed a local and distributed framework for decoding quantum low-density parity-check (LDPC) codes. This architecture, built upon belief propagation (BP), integrates strictly local processing of syndrome information, local feedback, autonomous operation, and highly parallelized decoding. This advancement is crucial for quantum computing, where LDPC codes hold promise for error correction, but efficient decoding remains a challenge.

The study addresses two complementary levels. First, they show that any code exhibiting a threshold under iterative BP decoding can be promoted to an autonomous local measurement-and-feedback dynamics while preserving that threshold. This means the inherent robustness of certain codes against errors is maintained even with a more distributed decoding approach. The second level focuses on codes where naive BP itself does not exhibit threshold behavior. The key insight is that BP can nevertheless provide sufficiently accurate local marginal information. Active syndrome defects use these local beliefs to move, pair, and annihilate through asynchronous feedback.

Numerically, this construction exhibits threshold behavior in the point-like sectors of the two- and three-dimensional toric codes, where conventional BP decoding fails. This represents a significant improvement in the ability to correct errors in quantum architectures. Exploiting the graph-generality of BP, the team also investigated the inference dynamics on the membrane-like sector of the three-dimensional toric code and in a family of bivariate-bicycle quantum LDPC codes, demonstrating the method's versatility. This approach could accelerate the development of fault-tolerant quantum computers by offering more scalable and efficient error decoding.