arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2609.11457quant-phcond-mat.stat-mechnlin.CG

容错量子计算与平移不变稳定子码的局域译码器

Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes

  • University of California, Berkeley(加州大学伯克利分校)
  • California Institute of Technology(加州理工学院)

机构由 AI 辅助整理,请以论文原文为准。

Nathaniel Selub, Aditya Bhardwaj, Ethan Lake

AI总结:

本文提出首个基于拓扑码的二维空间局域容错量子计算架构,核心是时间平移不变元胞自动机表面码译码器,并证明平移不变拓扑稳定子码在现象学噪声下可局域译码。

AI中文摘要:

我们构建了第一个基于拓扑码的、在少于四个空间维度中完全空间局域的容错量子计算机。我们的构造是一个二维架构,仅使用几何局域的量子与经典操作、有界速度的经典通信与计算,以及恒定的量子与经典资源密度。核心组件是一种新的用于表面码的时间平移不变元胞自动机译码器。该译码器在码距离的拉伸指数时间内保持逻辑信息,并在态注入、稳定子态制备、晶格手术和横向读出过程中持续运行。我们还证明了在现象学噪声下,每个平移不变拓扑泡利稳定子码都是可局域译码的。

英文摘要:

We construct the first fully spatially local fault-tolerant quantum computer based on topological codes in fewer than four spatial dimensions. Our construction is a two-dimensional architecture that uses only geometrically local quantum and classical operations, bounded-speed classical communication and computation, and a constant density of quantum and classical resources. The core component is a new time-translation-invariant cellular-automaton decoder for the surface code. This decoder preserves logical information for a time stretched-exponential in the code distance and operates continuously during state injection, stabilizer-state preparation, lattice surgery, and transversal readout. We also prove that every translation-invariant topological Pauli stabilizer code is locally decodable under phenomenological noise.

补充信息

↑