arXiv (All)
open access
Fully Parallelized BP Decoding for Quantum LDPC Codes Can Outperform BP-OSD
This work presents a hardware-efficient and fully parallelizable decoder for quantum LDPC codes that leverages belief propagation (BP) with a speculative post-processing strategy inspired by classical Chase decoding algorithm. By monitoring bit-level oscillation patterns during BP, our method identi
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
- Fast computational primitives for La-cross qLDPC codes#1296692
- High-Rate Quasi-Dyadic Quantum LDPC Codes#1050384
- Intermodal quantum key distribution over an 18 km free-space channel with adaptive optics and room-temperature detectors#1156284
- Building blocks for spin-photon quantum computation with semiconductor quantum dot devices#11447
- Multi-mode Unrolled Architectures for Polar Decoders#1061533
Record · ID 1455337
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