Provably Efficient Self-Calibrating Quantum Fault Tolerance

📄 arXiv: 2608.05686v1 📥 PDF

作者: Weiyuan Gong, Hong-Ye Hu

分类: quant-ph, cs.LG

发布日期: 2026-08-06

备注: 64 pages, 12 figures

💡 一句话要点

提出自校准量子容错方法以解决持续校准问题

🎯 匹配领域: 支柱八：物理动画 (Physics-based Animation)

关键词: 量子计算 量子容错 自校准 错误纠正 在线优化 低密度奇偶校验码 控制参数漂移

📋 核心要点

  1. 现有量子容错方法在长时间计算中面临控制参数漂移的问题，频繁校准不切实际。
  2. 论文提出通过将综合测量作为校准信号，建立自校准量子容错的理论框架，确保高效性。
  3. 实验结果表明，该方法在时间独立和时间依赖漂移下均能有效收敛，且与量子低密度奇偶校验码的码距无关。

📝 摘要（中文）

量子错误纠正仅在所有物理操作保持在容错阈值以下时才能保护逻辑信息，而这一条件必须持续维持。由于环境波动，控制参数不可避免地会漂移，导致在长时间量子计算中频繁重新校准变得不切实际。本文建立了自校准量子容错的理论框架，证明了对于广泛的控制引起的错误，检测率定义了一个局部强凸的替代目标，能够高效地在线优化。我们证明了在时间独立漂移下，检测率的收敛时间为$O(1/ ext{ε}^2)$，并为时间依赖漂移建立了保证。实验结果验证了理论预测，表明自校准容错是一种高效的范式。

🔬 方法详解

问题定义：本文解决的是量子计算中控制参数漂移导致的校准问题，现有方法无法在长时间计算中有效应对这一挑战。

核心思路：通过将综合测量重新利用为校准信号，论文提出了一种自校准量子容错的方法，旨在实现高效的在线优化。

技术框架：整体架构包括错误检测、校准信号生成和在线优化三个主要模块，利用收集的综合测量数据进行实时校准。

关键创新：论文的主要创新在于证明了检测率作为局部强凸替代目标的几何特性，使得在线优化成为可能，且收敛速度与码距无关。

关键设计：在设计中，采用了特定的损失函数以优化检测率，并通过脉冲级别的中性原子阵列和大规模电路级Clifford模拟进行验证。实验结果支持了理论框架的有效性。

🖼️ 关键图片

fig_0
fig_1
fig_2

📊 实验亮点

实验结果表明，在时间独立漂移下，检测率的收敛时间为$O(1/ ext{ε}^2)$，并且在时间依赖漂移的情况下也能保持高效性。脉冲级别模拟和电路级模拟均验证了理论预测，显示出自校准容错的有效性。

🎯 应用场景

该研究的潜在应用领域包括量子计算、量子通信和量子网络等，能够显著提升量子系统的稳定性和可靠性，推动量子技术的实际应用和发展。

📄 摘要（原文）

Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration. In practice, however, analog control parameters inevitably drift because of environmental fluctuations. As future fault-tolerant quantum computations are expected to run for days or even months, interrupting computation for repeated recalibration becomes fundamentally impractical. A promising alternative is to integrate calibration directly into computation by repurposing syndrome measurements as a calibration signal (Sivak et al, Nature 2026), but whether such self-calibration can be achieved with provable efficiency remains an open question. Here we establish a theoretical framework for self-calibrating quantum fault tolerance. We prove that, for a broad class of control-induced errors, the detection rate defines a locally strongly convex surrogate objective for analog calibration with high probability. This geometric property enables efficient online optimization using only syndrome measurements collected during normal error correction. We prove convergence to an $\varepsilon$ detection rate within $O(1/\varepsilon^2)$ epochs for time-independent drifts and also establish guarantees for time-dependent drifts. We further show that the convergence rate is independent of the code distance for quantum low-density parity-check (LDPC) codes. Pulse-level simulations of neutral-atom arrays and large-scale circuit-level Clifford simulations confirm these theoretical predictions. Our results establish self-calibrating fault tolerance as a provably efficient paradigm in which the same syndrome measurements simultaneously protect logical information and stabilize the underlying hardware.