arXiv (All)
open access
Quantum LDPC and High-Rate CSS Codes from Fair-Density Parity-Check Codes
We construct quantum LDPC (qLDPC) and high-rate CSS codes from our recently introduced classical fair-density parity-check (FDPC) codes. To this end, we introduce a structured sparsification of FDPC parity-check matrices, which reduces their check weights while preserving the underlying combinatoria
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
- Transversal non-Clifford gates on good quantum locally testable codes#1064919
- Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes#1156003
- Constant-rate quantum codes with low-weight stabilizers and full logical Clifford actions via transversal and fold-transversal gates#1142011
- Fiber-based double-pass single-crystal photon-pair source for quantum key distribution in a network / Maximilian Tippmann, Erik Fitzke, Oleg Nikiforov, Philipp Kleinpaß, Till Dolejsky, Maximilian Mengler, Thomas Walther#1145415
- Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering#1136763
Record · ID 821147
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