arXiv (All)
open access
From Random Quantum Codes to Explicit qLDPC Codes via Local Properties
Constructing explicit codes matching the parameters of random codes has been a central and largely elusive question in coding theory. The quantum setting is even more challenging since it is highly desirable that the quantum code be an LDPC code. Local coordinate-wise linear (LCL) [Levi, Mosheiff,
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
- Universality Sacrifices Reliability in Classical-Quantum Channel Coding#1157212
- Asymptotically Good Quantum Locally Testable Codes#1034573
- Universal representation of the long-range entanglement in the family of Toric Code states#1014541
- Intrinsic locality dimension of quantum codes#615041
- Intrinsic locality dimension of quantum codes#614074
Record · ID 1154514
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