用于确定量子纠错码性能和容错能力的改进方法
Improved Methods for Determining Quantum Error Correcting Code Performance and Fault Tolerance
浏览论文内容
中文总结 AI 辅助
本文针对量子纠错低错误率下逻辑失败率估计收敛慢的问题，提出剪枝算法和子区域 MCMC 两种新方法，提升了性能评估的收敛速度。
中文摘要 AI 辅助
量子纠错的核心挑战之一，是确定在实现实用规模计算所需的低错误 regime 下的码性能。虽然这些错误率下的性能无法通过直接蒙特卡洛模拟得到，但假设逻辑错误率随码距增大或物理错误率减小呈可预测缩放，可从较高逻辑错误率的模拟结果外推。然而，预期缩放对不可纠正错误模式的最小权重高度敏感。很多情况下最小权重未知，因为它不仅取决于理论码距，还取决于实现细节。Bravyi 和 Vargo 提出的适配量子纠错的马尔可夫链蒙特卡洛（MCMC）方法，提供了通过模拟估计低错误 regime 下逻辑失败率的途径。尽管相比蒙特卡洛有显著提升，但所述 Metropolis 算法仅对当前逻辑失败模式做小改动，导致收敛缓慢。本文指出典型失败模式包含大量易纠正错误，与恶性核心共存。该观察催生两种评估码性能的新方法：其一，描述一种剪枝算法，旨在排除这些可纠正错误，聚焦有问题的低权重核心；其二，开发一种新型 Metropolis-Hastings 算法族，称为子区域 MCMC，该技术以每步重采样的错误模式比例为参数，有效在蒙特卡洛和单步 MCMC 间插值。我们表明，该参数的明智选择可实现比先前工作快得多的收敛速度。
英文摘要
One of the central challenges in quantum error correction is determining the performance of a code in the low-error regimes needed to implement utility-scale computations. While performance at these error rates is not amenable to direct Monte Carlo simulation, it can be extrapolated from simulations at higher logical error rates, assuming the logical error rate scales predictably with increasing distance or decreasing physical error rate. However, the expected scaling depends sensitively on the minimum weight of uncorrectable error patterns. In many cases, the minimum weight is unknown since it depends not only on the theoretical code distance, but also on details of the implementation. Markov chain Monte Carlo (MCMC) methods, as adapted to quantum error correction by Bravyi and Vargo, provide a way to estimate logical failure rates in these low-error regimes via simulation. While offering significant gains over Monte Carlo, the described Metropolis algorithm makes small changes to the current logical failure patterns which results in slow convergence. In this paper, we argue that typical failure patterns include a large number of easily correctable errors that coexist alongside a malignant core. This observation motivates two new approaches to better evaluate code performance. First, we describe a pruning algorithm designed to obviate these correctable errors and focus on the problematic low-weight core. Second, we develop a novel family of Metropolis-Hastings algorithms, referred to as subregion MCMC. This technique is parameterized by the fraction of the error pattern that is resampled at each step, effectively interpolating between Monte Carlo and single step MCMC. We show that a judicious choice of this parameter results in far faster convergence than prior work.
