arXiv (All)
open access
Certified Non-Degenerate Maximum-Likelihood Benchmarking of Quantum LDPC Decoders
The measured logical error rate of a quantum low-density parity-check (QLDPC) code depends on the decoding algorithm. We develop a framework that certifies non-degenerate maximum-likelihood (ML) decoding outcomes on individual sampled shots under circuit-level noise, providing a common reference for
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
- Disassembling qLDPC codes for depth-optimal parity-check circuits#1201039
- Syndrome measurements enable deterministic fault-tolerant $T$ gates#1077961
- Efficient Logic with Ultra-High-Rate Quantum Codes#1215835
- Fault-tolerant and fully addressable unitary logical gates via round-robin sparsification#1188305
- Parallelizable and addressable transversal non-Clifford gates on good quantum LDPC codes#1393814
Record · ID 1411983
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