标题： 广度优先图遍历并查集解码器 显示英文标题

标题： Breadth-first graph traversal union-find decoder

摘要： 快速解码算法对于实时量子纠错和分析纠错码的特性至关重要。 在这里，我们开发了联合查找解码器的变体，这些变体简化了其实现并提供了潜在的解码速度优势。 此外，我们展示了如何将这些方法适应于解码非拓扑量子低密度奇偶校验（qLDPC）码。 所有开发的解码器可以直接在解码步骤中包含量子比特擦除和泡利错误，从而解决光子量子计算中的主要噪声机制。 我们研究了不同解码器变体的优缺点，在多个代码上对其速度和阈值错误率进行了基准测试，并提供了使用的源代码。 显示英文摘要

摘要： 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.