← 研踪 PaperTrailarXiv:2610.41398 · v2
Distilling Knowledge from Search: Decoder Model Factory for Quantum LDPC Codes
首次提交 2026-10-30 16:09
版本更新 2026-11-16 17:40
雷达观测 2026-11-17 17:11
摘要
We introduce GraphMP, a learning-based message-passing decoder for quantum low-density parity-check codes that transfers without fine-tuning across code families, code sizes, physical error rates, and noise models. Its local message passing keeps computation scalable as the decoding graph grows. We further embed GraphMP in a beam-search algorithm that progressively refines candidate error patterns, trading additional decoding time for lower logical error rates. To turn this decoding effort into lasting improvements, we propose the decoder model factory, a paradigm for training successive models on data collected by earlier models during decoding. In our implementation, verified search trajectories provide reusable training data for distilling knowledge into subsequent models. Across generations, the model factory yields a search-enhanced decoder that is broadly competitive with Relay-BP. On the largest code block, which encodes logical qubits, it achieves a lower logical error rate and about times the decoding throughput of the standard Relay-BP baseline. These results motivate a coupled quantum-classical architecture with two interacting cycles: rapid decoding protects quantum information, while slower learning adapts the models to changing noise conditions. The long-term vision is a scalable decoder model factory that continually produces high-performance, low-latency decoders for evolving quantum hardware.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-16 17:40 · 最新观测版本
Distilling Knowledge from Search: Decoder Model Factory for Quantum LDPC Codes
We introduce GraphMP, a learning-based message-passing decoder for quantum low-density parity-check codes that transfers without fine-tuning across code families, code sizes, physical error rates, and noise models. Its local message passing keeps computation scalable as the decoding graph grows. We further embed GraphMP in a beam-search algorithm that progressively refines candidate error patterns, trading additional decoding time for lower logical error rates. To turn this decoding effort into lasting improvements, we propose the decoder model factory, a paradigm for training successive models on data collected by earlier models during decoding. In our implementation, verified search trajectories provide reusable training data for distilling knowledge into subsequent models. Across generations, the model factory yields a search-enhanced decoder that is broadly competitive with Relay-BP. On the largest code block, which encodes logical qubits, it achieves a lower logical error rate and about times the decoding throughput of the standard Relay-BP baseline. These results motivate a coupled quantum-classical architecture with two interacting cycles: rapid decoding protects quantum information, while slower learning adapts the models to changing noise conditions. The long-term vision is a scalable decoder model factory that continually produces high-performance, low-latency decoders for evolving quantum hardware.
查看此版本解读 →查看此版本原文 ↗