arXiv (OAI Expanded)
open access
Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound
We construct asymptotically good nested Calderbank-Shor-Steane (CSS) code pairs from Hsu-Anastasopoulos codes and MacKay-Neal codes. For fixed balanced triples with even component degrees and $j_Z\ge4$, we prove that the coding rate stays bounded away from zero and that the relative distances on bot
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Good Quantum Locally Testable Codes from Lossless Cubical Complexes#1155460
- Affine-Profile Stabilizer Thresholds for Magic in Codeword-Stabilized Quantum Codes#792834
- Affine-Profile Stabilizer Thresholds for Magic in Codeword-Stabilized Quantum Codes#788830
- Intrinsic locality dimension of quantum codes#615041
- Intrinsic locality dimension of quantum codes#614074
Record · ID 1083061
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive