Cyclic Hypergraph Product Code

Arda Aydin, Nicolas Delfosse, Edwin Tham · 2025 · arXiv 2025

| 编号 QE127 | 主题 qLDPC 码 | 链接 arXiv:2511.09683 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

Hypergraph product (HGP) codes are one of the most popular family of quantum low-density parity-check (LDPC) codes. Circuit-level simulations show that they can achieve the same logical error rate as surface codes with a reduced qubit overhead. They have been extensively optimized by importing classical techniques such as the progressive edge growth, or through random search, simulated annealing or reinforcement learning techniques. In this work, instead of machine learning (ML) algorithms that improve the code performance through local transformations, we impose additional global symmetries, that are hard to discover through ML, and we perform an exhaustive search. Precisely, we focus on th

本站词条在引用该文献时，会以 wikilink（sources/QE127）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。