发表机构
Quantum Source Labs（量子源实验室）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
该研究在复合光子-原子量子架构中对比RHG码、FFCC及其简化版的电路级损耗性能，发现RHG阈值最高，仅在模块间CZ连接大额外损耗时低于简化FFCC，需权衡图度益处与多因素。
AI 中文摘要
我们在复合光子-原子架构中比较了Raussendorf-Harrington-Goyal（RHG）码、层状弗洛凯色码（FFCC）及简化FFCC，该架构可通过近确定性光子-原子CZ门直接生成基于测量的量子计算（MBQC）资源。RHG作为天然基准，FFCC变体使我们能在具备延迟预示和关联键损耗传播的架构感知电路级损耗模型下，研究简化图度是否提升性能。我们构建了两种与复合硬件兼容的生成方案，评估了周期边界条件下的电路级阈值。RHG实现了最高的电路级阈值，为2.75%，仅在模块间CZ连接存在大额外损耗时，其阈值才低于简化FFCC。在多数资源匹配对比中，RHG还实现了最低的逻辑错误率，但部分低损耗窗口更有利于简化FFCC。总体而言，我们表明当硬件支持MBQC所需的原生门和连通性时，必须权衡降低图度的益处与各码的固有IID损耗容忍度、生成方案细节及硬件感知资源开销。
英文摘要
A central question for fault-tolerant quantum computing is which quantum error-correcting codes are best suited to a given hardware architecture. Here we compare the Raussendorf--Harrington--Goyal (RHG) code, the Foliated Floquet Color Code (FFCC), and the reduced FFCC in a compound photon--atom architecture that directly generates measurement-based quantum computation (MBQC) resources with near-deterministic photon--atom CZ gates. RHG serves as a natural benchmark, while the FFCC variants allow us to study whether reduced graph degree improves performance under an architecture-aware circuit-level loss model with delayed heralding and correlated bond-loss propagation. We construct two generation schemes compatible with the compound hardware and evaluate circuit-level thresholds under periodic boundary conditions. RHG achieves the highest circuit-level threshold, 2.75%, and its threshold falls below that of reduced FFCC only for large excess loss on intermodule CZ connections. RHG also achieves the lowest logical error rate in most resource-matched comparisons, but some low-loss windows favor reduced FFCC. Overall, we show that when the hardware supports the native gates and connectivity required for MBQC, the benefits of lower graph degree must be weighed against each code's intrinsic IID loss tolerance, generation-scheme details, and hardware-aware resource overhead.
Comments20 pages, 15 figures; includes Supplementary Material
