arXiv (All)
open access
Fast computational primitives for La-cross qLDPC codes
Quantum LDPC codes promise to reduce the overhead of fault-tolerant quantum computation, but their practical use requires efficient logical gates, measurements, and access to non-Clifford resources. Here, we develop a complete set of computational primitives for La-cross hypergraph product codes. Fo
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
- Constant-rate quantum codes with low-weight stabilizers and full logical Clifford actions via transversal and fold-transversal gates#1142011
- High-Rate Quasi-Dyadic Quantum LDPC Codes#1050384
- Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes#1156003
- Full Extractors for Logical Processing in Hypergraph Product Codes#798935
- Full Extractors for Logical Processing in Hypergraph Product Codes#797521
Record · ID 1296692
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