论文标题
随时间并行化的可扩展表面代码解码器
Scalable surface code decoders with parallelization in time
论文作者
论文摘要
快速的经典处理对于大多数量子耐受性架构至关重要。我们引入了一个滑动窗口解码方案，该方案通过并行性为表面代码提供了快速的经典处理。我们的方案将时空中的综合症划分为沿时间方向重叠的窗口，可以与任何内部解码器并行解码。借助此并行性，即使内部解码器很慢，我们的方案也可以在代码扩展时解决解码的吞吐量问题。当使用Min-Weight Perfect匹配和Union-Find作为内部解码器时，我们观察到电路级阈值$ 0.68 \％$ $和$ 0.55 \％$，几乎与$ 0.70 \％$ $和$ 0.55 \％$相同。
Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism. Our scheme divides the syndromes in spacetime into overlapping windows along the time direction, which can be decoded in parallel with any inner decoder. With this parallelism, our scheme can solve the decoding throughput problem as the code scales up, even if the inner decoder is slow. When using min-weight perfect matching and union-find as the inner decoders, we observe circuit-level thresholds of $0.68\%$ and $0.55\%$, respectively, which are almost identical to $0.70\%$ and $0.55\%$ for the batch decoding.
