Compare Papers
Paper 1
Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound
Kenta Kasai
- Year
- 2026
- Journal
- arXiv preprint
- DOI
- arXiv:2603.24588
- arXiv
- 2603.24588
We construct nested Calderbank-Shor-Steane code pairs with non-vanishing coding rate from Hsu-Anastasopoulos codes and MacKay-Neal codes. In the fixed-degree regime, we prove relative linear distance with high probability. Moreover, for several finite degree settings, we prove Gilbert-Varshamov distance by a rigorous computer-assisted proof.
Open paperPaper 2
Not found.