Modular decoding：量子计算机的可并行实时解码
Modular decoding: parallelizable real-time decoding for quantum computers
摘要：
通用容错量子计算将需要能够从噪声量子硬件生成的数据流中快速提取逻辑结果的实时解码算法。我们提出了模块化解码，一种能够以最小的额外通信来解决这一挑战的方法，而不会牺牲解码精度。我们介绍了边顶点分解，一个具体的例子，模解码的格手术风格的容错块，这是非常有效的。这种将全局解码问题分解为子任务的方法反映了容错量子线路的逻辑块网络结构。我们确定的缓冲条件作为一个关键的要求控制解码器的质量，它需要一个足够大的分离（缓冲区）之间的校正所提交的解码子任务和数据不可用it.We证明，故障距离的协议是保留，如果缓冲条件得到满足。最后，我们实现了边顶点模块化解码，并将其应用于各种量子线路，包括15比1魔态蒸馏协议的Clifford组件。对一系列缓冲器大小的蒙特卡罗模拟提供了定量证据，表明缓冲器对于保证解码器准确性是必要且足够的。我们的研究结果表明，模块化解码满足支持现实世界的容错量子计算机所需的所有实际要求。
英文摘要：
Universal fault-tolerant quantum computation will require real-time decoding algorithms capable of quickly extracting logical outcomes from the stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks which is remarkably effective. This decomposition of the global decoding problem into sub-tasks mirrors the logical-block-network structure of a fault-tolerant quantum circuit. We identify the buffering condition as a key requirement controlling decoder quality; it demands a sufficiently large separation (buffer) between a correction committed by a decoding sub-task and the data unavailable to it. We prove that the fault distance of the protocol is preserved if the buffering condition is satisfied. Finally, we implement edge-vertex modular decoding and apply it on a variety of quantum circuits, including the Clifford component of the 15-to-1 magic-state distillation protocol. Monte Carlo simulations on a range of buffer sizes provide quantitative evidence that buffers are both necessary and sufficient to guarantee decoder accuracy. Our results show that modular decoding meets all the practical requirements necessary to support real-world fault-tolerant quantum computers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
