arXiv AI By Anil Bilgin, Wanda Hou, Pranav Srinivas, Yi-Zhuang You

Distilling Knowledge from Search: Decoder Model Factory for Quantum LDPC Codes

Read the original on arXiv AI →

The paper introduces GraphMP, a learning-based message‑passing decoder for quantum low‑density parity‑check codes that can transfer across different code families, sizes, error rates, and noise models without fine‑tuning. GraphMP employs local message passing for scalability and uses beam search guided by its predictions to iteratively refine error patterns, balancing decoding time against logical error rates. The authors propose a decoder model factory that trains successive models on data generated by earlier models during decoding, enabling knowledge distillation and continuous adaptation to changing noise conditions.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Hugging Face Trending Papers
Oct 29

Fast and accurate neural triage decoding of ultra-high-rate quantum LDPC codes

The paper introduces neural triage decoding, a new framework that uses syndrome consistency to adaptively allocate neural computation for high-rate quantum LDPC codes. By combining a local neural message-passing network with iterative refinement and a rare diversification stage, the Triage decoder achieves state‑of‑the‑art accuracy while reducing decoding latency by one to two orders of magnitude. The approach is validated on ultra‑high‑rate qLDPC codes such as lifted‑product and Kasai codes, and demonstrates robustness to mismatched error priors.

arXiv AI
6d ago

Fast and accurate neural triage decoding of ultra-high-rate quantum LDPC codes

The paper introduces neural triage decoding, a new framework for high‑rate quantum LDPC codes that adaptively uses neural message‑passing to predict error corrections, followed by iterative refinement and a rare diversification step. It demonstrates that the Triage decoder can handle ultra‑high‑rate codes encoding hundreds of logical qubits, achieving near‑optimal accuracy while reducing decoding latency by one to two orders of magnitude compared to existing decoders. The approach is grounded in a rigorous analysis of bitwise marginal decoding and shows robustness to mismatched error priors.

By Hong-Ye Hu, Zhenlai Wang, Binzhao Luo, Tao Xiang, Chen Zhao
arXiv Machine Learning
Jul 23

Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era

arXiv:2602. 16018v2 Announce Type: replace-cross Abstract: Graph neural networks (GNNs) are a powerful framework for learning representations from graph-structured data, but their direct implementation on near-term quantum hardware remains challenging due to circuit depth, multi-qubit interactions, and qubit scalability constraints.

By Armin Ahmadkhaniha, Jake Doliskani