论文标题
在加权图上对联合获取解码器的解释
An interpretation of Union-Find Decoder on Weighted Graphs
论文作者
论文摘要
Union-Find（UF）和最小重量完美匹配（MWPM）是表面代码的流行解码器设计。前者的时间复杂性明显低于后者，但在解码准确性方面被认为有些较低。在这项工作中，我们提出了对UF解码器的解释，该解释解释了为什么在某些情况下可以紧密执行UF和MWPM解码器：UF解码器是用于MWPM的Blossom算法的近似实现。这种解释允许对加权解码图进行UF解码器的概括，并解释了为什么UF解码器在某些表面代码上具有很高的精度。
Union-Find (UF) and Minimum-Weight Perfect Matching (MWPM) are popular decoder designs for surface codes. The former has significantly lower time complexity than the latter but is considered somewhat inferior, in terms of decoding accuracy. In this work we present an interpretation of UF decoders that explains why UF and MWPM decoders perform closely in some cases: the UF decoder is an approximate implementation of the blossom algorithm used for MWPM. This interpretation allows a generalization of UF decoders for weighted decoding graphs and explains why UF decoders achieve high accuracy for certain surface codes.
