AI 中文总结
本文针对高码率冰山码构造了错误检测型手术组件，经模拟验证其具备错误检测能力，可用于近期基于泡利计算的错误检测演示，同时提供了规范固定和码手术的自包含介绍。
AI 中文摘要
我们为高码率冰山码 $[[2N,2N-2,2]]$ 构造了明确的错误检测型手术组件——由辅助量子比特和校验组成的小型系统，用于对逻辑泡利乘积进行错误检测型测量。该构造遵循将手术视为逻辑算子规范固定的视角，将逻辑算子视为码的对称性。我们在冰山码的置换自同构群下对逻辑泡利算子进行了完整分类，将构造简化为每个轨道对应一个组件，并通过电路级模拟验证这些组件具有错误检测能力，且具有预期的后选择逻辑错误率。这些组件需要可重构的长程连接，该连接在中性原子阵列等平台上可用，使得基于泡利计算的错误检测演示成为近期自然实验。本文同时作为规范固定和码手术的自包含介绍，辅以一个简单的实例讲解。
英文摘要
We construct explicit error-detecting surgery gadgets---small systems of auxiliary qubits and checks---for the high-rate Iceberg codes $[[2N,2N-2,2]]$, to perform fault-detected measurements of logical Pauli products. The construction follows the perspective of surgery as the gauging of a logical operator, regarded as a symmetry of the code. We give a complete classification of logical Pauli operators under the permutation automorphism group of the Iceberg code, reducing the construction to one gadget per orbit, and we verify with circuit-level simulations that the gadgets are fault-detecting, with the expected post-selected logical error rate. The gadgets require reconfigurable long-range connectivity, available on platforms such as neutral-atom arrays, making an error-detected demonstration of Pauli-based computation a natural near-term experiment. The paper doubles as a self-contained introduction to gauging and code surgery, developed alongside a simple worked example.
