仅 Clifford 量子 Reed-Solomon 码及用于有偏噪声猫量子比特的 Tornado 级联码
Biased-Noise Quantum Reed-Solomon Codes and a Tornado Concatenation for Cat Qubits
浏览论文内容
中文总结 AI 辅助
研究针对有偏噪声猫量子比特的纠错码，利用噪声偏差构建仅 Clifford 量子 Reed-Solomon 码，引入 Tornado 级联架构，经模拟其逻辑错误率低且缩放特性优，给出构造、模型分析及相关说明。
中文摘要 AI 辅助
耗散猫量子比特通过平均光子数指数抑制一个泡利错误通道，使共轭比特翻转错误成为主要失效模式。这种强噪声偏差使得通用量子纠错的完整机制不必要：代码只需防止单一错误类型，任何经典线性码都可提升为能做到这一点的 Clifford 稳定器码。我们利用此观察构建了仅 Clifford 量子 Reed-Solomon（RS）码。从\(GF(2^{3})\)上的\([7,3,5]\)RS 码开始，将每个字段符号扩展为三位，得到\(GF(2)\)上的\([21,9,6]\)线性码，实现为一个[[21,9,\(d_{X}=6\),\(d_{Z}=1\)]]比特翻转码，其稳定器是 Z 算子的乘积。由于不尝试相位翻转校正，该构造避免了 Grassl-Beth 量子 RS 码所需的非 Clifford 量子傅里叶变换，并且在 Stim 中完全可模拟。错误通过最小权重校正查找表解码。然后我们引入了 Tornado 架构：一种两层级联，将外层 RS 码的每个位置包裹在内层距离为三的重复码中，产生一个[[63,9,18]]码，分两个阶段解码，每个重复块内进行多数投票，然后是外层查找表。蒙特卡罗模拟表明，在物理比特翻转率\(p = 0.1\)时，Tornado 码达到逻辑错误率\(p_{L}\approx5.3\times10^{-3}\)，低于两个父码，并且在低\(p\)时其逻辑错误率按\(p_{L}\propto p^{6}\)缩放，与重复码的\(p^{2}\)和独立 RS 码的\(p^{3}\)形成对比。我们给出了精确构造、错误和电路模型、渐近缩放分析以及开销成本说明和噪声模型背后的假设。
英文摘要
Dissipative cat qubits exponentially suppress one Pauli error channel with the mean photon number, leaving the conjugate bit-flip error as the dominant failure mode. This strong noise bias makes the full machinery of general quantum error correction unnecessary: a code need only protect against a single error type, and any classical linear code can be promoted to a Clifford stabilizer code that does exactly this. We use this observation to build a bit-flip-only quantum Reed-Solomon (RS) code. Starting from the maximum-distance-separable RS code [7, 3, 5] over GF($2^3$), we binary-expand it to the linear code [21, 9, 6] over GF(2) and realize it as a [[21, 9, $d_X = 6, d_Z = 1$]] bit-flip code whose stabilizers are products of $Z$ operators. Because no phase-flip correction is attempted, the construction discards the redundancy that standard quantum RS codes spend on correcting $Z$ errors -- which a strongly biased cat qubit renders unnecessary -- and yields a shallow Clifford circuit that samples directly in Stim. Errors are decoded by an optimal bounded-distance syndrome-lookup table. We then introduce a Tornado architecture: a two-layer concatenation that wraps every position of the outer RS code in an inner distance-three repetition code, yielding a [[63, 9, 18]] code decoded by a two-stage inner majority vote and outer lookup decoder. Monte-Carlo simulation shows that at a physical bit-flip rate $p = 0.1$ the Tornado code reaches a logical error rate $p_L \approx 5.3 \times 10^{-3}$, below both parent codes, and that its logical error rate scales as $p_L \propto p^6$ at low $p$, in contrast to $p^2$ for the repetition code and $p^3$ for the standalone RS code. We give the exact construction, the error and circuit model, an asymptotic scaling analysis, and an honest account of the overhead cost and single-shot assumptions.
