电路级噪声下量子LDPC码的近线性时间解码算法
An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise
AI总结:
提出BP+OTF算法,通过有序Tanner森林后处理实现量子LDPC码的近线性时间解码,并引入检测器误差模型稀疏化技术提升电路级噪声性能,数值模拟显示其逻辑错误抑制与现有解码器相当。
摘要:
容错量子计算机必须与实时解码量子纠错测量信息的经典协处理器协同设计。本文提出置信传播加有序Tanner森林(BP+OTF)算法,作为量子低密度奇偶校验码的近线性时间解码器。OTF后处理阶段从解码图中移除量子比特,直至其具有树状结构。只要得到的无环OTF图支持能够生成综合征的量子比特子集,BP解码就能保证收敛。为提升电路级噪声下的性能,我们引入了一种稀疏化检测器误差模型的技术。该方法使用转移矩阵将软信息从完整检测器图映射到稀疏化图,保留了来自综合征提取电路的关键错误传播信息。我们的BP+OTF实现首先对完整检测器图应用标准BP,然后在稀疏化图上进行BP+OTF后处理。数值模拟表明,BP+OTF解码器在双变量自行车码和表面码上分别实现了与最先进的基于求逆和解匹配解码器相当的逻辑错误抑制,同时在所有阶段保持近线性运行时间复杂度。
英文摘要:
Fault-tolerant quantum computers must be designed in conjunction with classical co-processors that decode quantum error correction measurement information in real-time. In this work, we introduce the belief propagation plus ordered Tanner forest (BP+OTF) algorithm as an almost-linear time decoder for quantum low-density parity-check codes. The OTF post-processing stage removes qubits from the decoding graph until it has a tree-like structure. Provided that the resultant loop-free OTF graph supports a subset of qubits that can generate the syndrome, BP decoding is then guaranteed to converge. To enhance performance under circuit-level noise, we introduce a technique for sparsifying detector error models. This method uses a transfer matrix to map soft information from the full detector graph to the sparsified graph, preserving critical error propagation information from the syndrome extraction circuit. Our BP+OTF implementation first applies standard BP to the full detector graph, followed by BP+OTF post-processing on the sparsified graph. Numerical simulations show that the BP+OTF decoder achieves similar logical error suppression compared to state-of-the-art inversion-based and matching decoders for bivariate bicycle and surface codes, respectively, while maintaining almost-linear runtime complexity across all stages.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。