PreprintarXiv licencearXiv
Pathfinder-BP: A Low-Latency Recursive Decoder for Topological Codes
Abstract
We propose Pathfinder-BP, a recursive decoder for topological quantum codes that combines belief propagation with controlled bit-flipping. An initial BP pass identifies and permanently fixes high-confidence errors. Upon convergence failure, the decoder recursively explores alternative error patterns by tentatively flipping low-confidence variables. On surface codes, Pathfinder-BP achieves a noise threshold and logical error rate comparable to minimum-weight perfect matching (MWPM). A crucial advantage of Pathfinder-BP is its highly parallelizable structure, which yields a worst-case decoding latency quasi-linear in the code distance, making it a suitable candidate for low-latency hardware implementation.
Related
- Four-Level Quantized Soft Information Aided Hard-Decision Decoder for Product-like Codes
- Scalable Mamba-Based Message-Passing Neural Decoder for Error-Correcting Codes
- Low-Latency Belief-Propagation Decoding of Quantum LDPC Codes with Reinforcement-Learned Scheduling
- LDPC Fractus Codes: Sparse Codes with Recursive Structure
- Generating quantum error correcting codes from topological pre-thermal scars
BibTeX
@misc{tinelli2026pathfinderbp,
title = {{Pathfinder-BP: A Low-Latency Recursive Decoder for Topological Codes}},
author = {Stefano Tinelli and Francisco Lázaro and Francisco García Herrero},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.16375},
eprint = {2610.16375},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.16375},
}
RIS
TY - UNPB
TI - Pathfinder-BP: A Low-Latency Recursive Decoder for Topological Codes
AU - Stefano Tinelli
AU - Francisco Lázaro
AU - Francisco García Herrero
PY - 2026
DA - 2026/10/12
PB - arXiv
DO - 10.48550/arxiv.2610.16375
UR - https://arxiv.org/abs/2610.16375
AB - We propose Pathfinder-BP, a recursive decoder for topological quantum codes that combines belief propagation with controlled bit-flipping. An initial BP pass identifies and permanently fixes high-confidence errors. Upon convergence failure, the decoder recursively explores alternative error patterns by tentatively flipping low-confidence variables. On surface codes, Pathfinder-BP achieves a noise threshold and logical error rate comparable to minimum-weight perfect matching (MWPM). A crucial advantage of Pathfinder-BP is its highly parallelizable structure, which yields a worst-case decoding latency quasi-linear in the code distance, making it a suitable candidate for low-latency hardware implementation.
ER -