2025/10/08 by Venkata Gandikota, Gandikota, Venkata, Elena Grigorescu +4
Computer Science · #Complexity and Algorithms in Graphs #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2510.07602
openalex publication_date 2025/10/08 · openalex created_date 2025/10/11 · openalex updated_date 2026/07/28
Hypergraph product codes are a prototypical family of quantum codes with state-of-the-art decodability properties. In this work we consider the "noisy" syndrome decoding problem and exact recovery problem for hypergraph product codes and show a reduction to the decoding and exact recovery of classical codes in the noisy syndrome setting. Our results hold for a broad class of codes admitting efficient syndrome decoding, including Sipser-Spielman codes and Reed-Solomon codes.