arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.08419quant-phcs.AR
收藏

基于FPGA的表面码可扩展量子纠错

Scalable Quantum Error Correction for Surface Codes using FPGA

Namitha Liyanage, Yue Wu, Alexander Deters, Lin Zhong

AI总结:

本文提出基于FPGA的分布式Union-Find解码器,利用并行资源实现亚线性解码时间,使表面码纠错速度随距离增加而加快,显著优于现有实现。

摘要:

容错量子计算机必须以比错误出现更快的速度解码和纠正错误。错误纠正得越快,计算机就能有更多时间进行有用的工作。Union-Find (UF) 解码器具有前景,其平均时间复杂度略高于 $O(d^3)$。我们报告了一种分布式版本的 UF 解码器,利用并行计算资源进一步加速。通过基于 FPGA 的实现,我们经验性地表明,在给定 $O(d^3)$ 并行计算资源的情况下,该分布式 UF 解码器相对于 $d$ 具有亚线性的平均时间复杂度。每轮测量的解码时间随着 $d$ 的增加而减少,这是量子错误解码器首次实现。该实现采用了一种名为 Helios 的可扩展架构,将并行计算资源组织成混合树-网格结构。我们能够在 Xilinx VCU129 FPGA 上实现 $d$ 高达 21,在 0.1% 的现象学噪声下,每轮测量的平均解码时间为 11.5 纳秒,显著快于任何现有的解码器实现。由于 Helios 每轮测量的解码时间随 $d$ 减小,Helios 可以解码任意大 $d$ 的表面码,而不会产生不断增长的积压。

英文摘要:

A fault-tolerant quantum computer must decode and correct errors faster than they appear. The faster errors can be corrected, the more time the computer can do useful work. 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, a 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. We are able to implement $d$ up to 21 with a Xilinx VCU129 FPGA, for which an average decoding time is 11.5 ns per measurement round under phenomenological noise of 0.1\%, significantly faster than any existing decoder implementation. Since the decoding time per measurement round of Helios decreases with $d$, Helios can decode a surface code of arbitrarily large $d$ without a growing backlog.

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

↑