Actis:一种严格局部的Union-Find解码器
Actis: A Strictly Local Union-Find Decoder
AI总结:
本文提出Actis,一种严格局部的Union-Find解码器,通过最近邻处理器晶格实现,最坏运行时间O(d^3),平均次二次,并采用新颖奇偶校验方案优化电路级噪声。
摘要:
容错量子计算需要经典硬件来执行纠错所需的解码。Union-Find解码器是实现这一目标的最佳候选之一。它具有显著的自组织特性,通过最近邻步骤实现数据结构的发展和合并;这自然暗示了利用具有最近邻链接的简单处理器晶格来实现它的可能性。这样,计算负载可以以近乎理想的并行性进行分配。在这里,我们首次证明这种严格(而非部分)局部性是可行的,其最坏情况运行时间为$\mathcal O(d^3)$,平均运行时间在表面码距离$d$上为次二次。我们采用了一种新颖的奇偶校验计算方案,该方案可以简化先前提出的架构,并且我们的方法针对电路级噪声进行了优化。我们将我们的局部实现与通过长距离链接增强的实现进行比较;虽然后者当然更快,但我们注意到局部异步逻辑可以抵消这一差异。
英文摘要:
Fault-tolerant quantum computing requires classical hardware to perform the decoding necessary for error correction. The Union-Find decoder is one of the best candidates for this. It has remarkably organic characteristics, involving the growth and merger of data structures through nearest-neighbour steps; this naturally suggests the possibility of its realisation using a lattice of simple processors with nearest-neighbour links. In this way the computational load can be distributed with near-ideal parallelism. Here we show for the first time that this strict (rather than partial) locality is practical, with a worst-case runtime $\mathcal O(d^3)$ and mean runtime subquadratic in the surface code distance $d$. A novel parity-calculation scheme is employed which can simplify previously proposed architectures, and our approach is optimised for circuit-level noise. We compare our local realisation with one augmented by long-range links; while the latter is of course faster, we note that local asynchronous logic could negate the difference.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。