发表机构
QPerfect SAS; European Center for Quantum Sciences; QuEra Computing Inc.; Massachusetts Institute of Technology; University of Strasbourg; CNRS（QPerfect公司; 欧洲量子科学中心; QuEra计算公司; 麻省理工学院; 斯特拉斯堡大学; 法国国家科学研究中心）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文针对含非Clifford门的大规模量子纠错电路，通过优化矩阵积态技术，实现了多类QEC电路的高效精确模拟，为容错量子计算研究提供重要支撑。
AI 中文摘要
模拟包含非Clifford门的大规模量子纠错（QEC）电路，对推进容错量子计算的发展至关重要。本文证明矩阵积态（MPS）技术可精确处理多种QEC电路，且不受门类型限制；关键发现是MPS效率对实现选择高度敏感，为此引入一系列针对性优化，相比朴素方法可将键维度和模拟时间降低数个数量级。相关示例包括：(a) 距离达11的旋转表面码量子存储器；(b) 距离达9的逻辑贝尔态制备；(c) 经优化后仅用11个逻辑量子比特（187个物理量子比特）、最大键维度64、耗时不足40秒即可模拟的含数百轮QEC的15-to-1魔术态蒸馏电路；(d) 随T门数量线性缩放的窄而深随机电路。这些结果表明电路级优化的重要性，并确立MPS作为近Clifford模拟器的重要补充，可用于QEC电路模拟。
英文摘要
Simulating quantum error correction (QEC) circuits including non-Clifford gates at scale is important to accelerate progress toward fault-tolerant quantum computing. Here we demonstrate that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types. Crucially, we find that MPS efficiency depends sensitively on implementation choices, and we introduce a series of targeted optimizations that reduce bond dimensions and simulation time by several orders of magnitude compared to naive approaches. We illustrate this with examples including: (a) a rotated surface code quantum memory up to distance 11, (b) logical Bell-state preparation up to distance 9, (c) a 15-to-1 magic-state distillation circuit including hundreds of QEC rounds that we optimize to be simulated with only 11 logical qubits (187 physical qubits) and a maximal bond dimension of 64 in under 40 seconds, and (d) a narrow, deep random circuit that scales linearly with the number of T gates. These results demonstrate the importance of circuit-level optimizations and position MPS as a valuable complement to near-Clifford simulators for QEC circuits.
Comments15 pages, 10 figures
