vix.ing · top · new · best · stats · spec

Breadth-first graph traversal union-find decoder

2024/07/22 by Matthias C. Löbl, Löbl, Matthias C., Susan X. Chen +5 · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · #DNA and Biological Computing #Error Correcting Code Techniques #FOS: Physical sciences #Interconnection Networks and Systems #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2407.15988

openalex publication_date 2024/07/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Fast decoding algorithms are decisive for real-time quantum error correction and for analyzing properties of error correction codes. Here, we develop variants of the union-find decoder that simplify its implementation and provide potential decoding speed advantages. Furthermore, we show how these methods can be adapted to decode non-topological quantum low-density-parity-check (qLDPC) codes. All the developed decoders can directly include both qubit erasures and Pauli errors in the decoding step, thus addressing the dominant noise mechanisms for photonic quantum computing. We investigate the strengths and weaknesses of the different decoder variants, benchmark their speed and threshold error rates on several codes, and provide the used source code.

Cited by

Related