Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2510.07602 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Tabla de Contenidos:
- 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.