Random Construction of Quantum LDPC Codes

Koki Okada, Kenta Kasai · 2025 · arXiv 2025

| 编号 QE137 | 主题 qLDPC 码 | 链接 arXiv:2511.04634 |

摘要

摘要保留原文（英文）

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

We propose a method for modifying orthogonal sparse matrix pairs used in CSS codes while preserving their matrix row and column weight distributions, which play a crucial role in determining the performance of belief-propagation decoding. Unlike simple row or column permutations that merely reorder existing elements, the proposed local modification introduces genuine structural randomness through small $2\times 2$ cross-swap operations followed by integer-linear-program-based local repairs that restore orthogonality. By applying this procedure repeatedly in a random manner, ensembles of randomized quantum LDPC codes can be constructed. The computational complexity of each repair depends only

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