arXiv (OAI Expanded)
open access
Breakeven demonstration of quantum low-density parity-check codes
High-rate quantum low-density parity-check (qLDPC) codes are a leading candidate for fault-tolerant quantum computing. They feature higher encoding rates than planar alternatives such as the surface code, but their implementation often entails significant hardware hurdles like the need for long-rang
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
- Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes#1156003
- Generalized Parity Measurements and Efficient Large Multi-component Cat State Preparation with Quantum Signal Processing#925722
- Constant-rate quantum codes with low-weight stabilizers and full logical Clifford actions via transversal and fold-transversal gates#1142011
- Syndrome measurements enable deterministic fault-tolerant $T$ gates#1077961
- Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation#2602
Record · ID 1109069
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