arXiv (All)
open access
Breaking the Orthogonality Barrier in Quantum LDPC Codes
Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth of the Tanner graph while maintaining regular degree distrib
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
- Quantum LDPC and High-Rate CSS Codes from Fair-Density Parity-Check Codes#821147
- LDPC Fractus Codes: Sparse Codes with Recursive Structure#1131091
- Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes#1156003
- Efficient Probabilistic Design of High-Performance Modern Low-Density Parity-Check Codes#679503
- Transversal non-Clifford gates on good quantum locally testable codes#1064919
Record · ID 986189
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