paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Promatch: Extending the Reach of Real-Time Quantum Error Correction with Adaptive Predecoding

Promatch:以自适应预解码拓展实时量子纠错的可达距离
ASPLOS Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 32024匹配度 1/10 · 论文研究量子纠错中的实时预解码算法,属于量子计算/纠错领域,与用户画像中的 PL/AI 交叉、浮点程序分析、贝叶斯程序分析等方向没有直接关联。引用 34 inbox
Narges Alavisamani, Suhas Vittal, Ramin Ayanzadeh, Poulami Das, Moinuddin Qureshi
crossref: 2026-09-12dblp: 2026-09-12arxiv: 2026-09-12

AI 速览

一句话:提出实时自适应预解码器 Promatch,用局部性感知贪心预匹配降低综合征汉明重量,使实时 MWPM 首次可解码距离 11 与 13 的 surface code。

容错量子计算依赖量子纠错,解码器必须把测得的校验位实时(超导机器上 1μs 内)翻译为错误类型与位置。最小权重完美匹配(MWPM)对 surface code 精度高,但已有实时实现(RT-MWPM)仅支持到距离 9:再往上,综合征中被翻转校验位的数量(综合征汉明重量)超出解码器能力。本文提出 Promatch——一个实时自适应预解码器,用局部性感知的贪心方法对简单与复杂错误模式做预匹配,把高汉明重量综合征转换为低汉明重量综合征,再交由 RT-MWPM 精确解码。设计需同时保证预匹配的准确率(预解码的错误会直接抬高整体逻辑错误率 LER)与覆盖率(须在时间约束下把重量压到主解码器可处理的范围)。Promatch 是首个可实时解码距离 11 和 13 的框架,距离 13 时 LER 为 2.6×10⁻¹⁴;与 Astrea-G 并发运行后,距离 13 的 LER 达到与 MWPM 相当的 3.4×10⁻¹⁵,成为首个可实时精确解码至距离 13 的解码器。

问题
实时量子纠错解码须在 1μs 内完成,而现有实时 MWPM 解码器在 surface code 距离超过 9 时,因综合征汉明重量过大而无法胜任。
方法
Promatch 是一种实时自适应预解码器,采用局部性感知的贪心策略对简单与复杂错误模式进行预匹配(predecode),将高汉明重量综合征降为低汉明重量,并按主解码器的能力与时间约束平衡准确率与覆盖率。
评估
在 surface code 距离 11 与 13 上测量逻辑错误率(LER),并与实时 MWPM 以及近期提出的 Astrea-G 组合运行进行对比,验证其实时性与解码精度。
原文摘要(Abstract)

Fault-tolerant quantum computing relies on Quantum Error Correction (QEC), which encodes logical qubits into data and parity qubits. Error decoding is the process of translating the measured parity bits into types and locations of errors. To prevent a backlog of errors, error decoding must be performed in real-time (i.e., within 1μs on superconducting machines). Minimum Weight Perfect Matching (MWPM) is an accurate decoding algorithm for surface code, and recent research has demonstrated real-time implementations of MWPM (RT-MWPM) for a distance of up to 9. Unfortunately, beyond d=9, the number of flipped parity bits in the syndrome, referred to as the Hamming weight of the syndrome, exceeds the capabilities of existing RT-MWPM decoders. In this work, our goal is to enable larger distance RT-MWPM decoders by using adaptive predecoding that converts high Hamming weight syndromes into low Hamming weight syndromes, which are accurately decoded by the RT-MWPM decoder. An effective predecoder must balance both accuracy (as any erroneous decoding by the predecoder contributes to the overall Logical Error Rate, termed as LER) and coverage (as the predecoder must ensure that the hamming weight of the syndrome is within the capability of the final decoder). In this paper, we propose Promatch, a real-time adaptive predecoder that predecodes both simple and complex patterns using a locality-aware, greedy approach. Our approach ensures two crucial factors: 1) high accuracy in prematching flipped bits, ensuring that the decoding accuracy is not hampered by the predecoder, and 2) enough coverage adjusted based on the main decoder's capability given the time constraints. Promatch represents the first real-time decoding framework capable of decoding surface codes of distances 11 and 13, achieving an LER of 2.6 × 10-14 for distance 13. Moreover, we demonstrate that running Promatch concurrently with the recently proposed Astrea-G achieves LER equivalent to MWPM LER, 3.4 × 10-15, for distance 13, representing the first real-time accurate decoder for up-to a distance of 13.

链接与引用

DOI 原文 · arXiv · PDF(开放获取) · DBLP

BibTeX
@inproceedings{AlavisamaniVA0Q24,
  title = {Promatch: Extending the Reach of Real-Time Quantum Error Correction with Adaptive Predecoding},
  author = {Narges Alavisamani and Suhas Vittal and Ramin Ayanzadeh and Poulami Das and Moinuddin Qureshi},
  booktitle = {ASPLOS},
  year = {2024},
  doi = {10.1145/3620666.3651339}
}