arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.08491quant-phcs.DC
收藏

面向表面码的基于 FPGA 的分布式 Union-Find 解码器

FPGA-based Distributed Union-Find Decoder for Surface Codes

Namitha Liyanage, Yue Wu, Siona Tagare, Lin Zhong

AI总结:

提出基于 FPGA 的分布式 Union-Find 解码器及 Helios 混合树-网格架构,在表面码上实现随码距增大而下降的每轮解码时间,并以极低延迟支持 d 至 51。

摘要:

容错量子计算机必须以快于错误出现的速度解码并纠正错误,以防止因纠错导致的指数级减速。Union-Find(UF)解码器颇具前景,其平均时间复杂度略高于 $O(d^3)$。我们报告了该 UF 解码器的一个分布式版本,利用并行计算资源进一步加速。通过基于 FPGA 的实现,我们以实验表明,在给定 $O(d^3)$ 并行计算资源的情况下,该分布式 UF 解码器关于 $d$ 具有次线性平均时间复杂度。每个测量轮次的解码时间随 $d$ 增大而减少,这在量子错误解码器中尚属首次。该实现采用名为 Helios 的可扩展架构,将并行计算资源组织成混合树-网格结构。使用 Xilinx VCU129 FPGA,我们成功实现了最高 $d=21$,在 0.1% 唯象噪声下每个测量轮次的平均解码时间为 11.5 ns;在等效电路级噪声下,$d=17$ 时为 23.7 ns。这一性能显著快于任何现有解码器实现。此外,我们表明 Helios 可优化资源效率:在 Xilinx VCU129 FPGA 上解码 $d=51$,每个测量轮次的平均延迟为 544 ns。

英文摘要:

A fault-tolerant quantum computer must decode and correct errors faster than they appear to prevent exponential slowdown due to error correction. The Union-Find (UF) decoder is promising with an average time complexity slightly higher than $O(d^3)$. We report a distributed version of the UF decoder that exploits parallel computing resources for further speedup. Using an FPGA-based implementation, we empirically show that this distributed UF decoder has a sublinear average time complexity with regard to $d$, given $O(d^3)$ parallel computing resources. The decoding time per measurement round decreases as $d$ increases, the first time for a quantum error decoder. The implementation employs a scalable architecture called Helios that organizes parallel computing resources into a hybrid tree-grid structure. Using a Xilinx VCU129 FPGA, we successfully implement $d$ up to 21 with an average decoding time of 11.5 ns per measurement round under 0.1\% phenomenological noise, and 23.7 ns for $d=17$ under equivalent circuit-level noise. This performance is significantly faster than any existing decoder implementation. Furthermore, we show that Helios can optimize for resource efficiency by decoding $d=51$ on a Xilinx VCU129 FPGA with an average latency of 544ns per measurement round.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑