Provable qLDPC decoders whose proven thresholds match observed ones
50No. 664 in all physics · No. 31 in Quantum Information and Foundations
This text mentions work from 2024 on. Those parts were partly written without a live literature search and have not been checked by an editor yet.
Error correction needs a classical computer to read the check results and decide what went wrong before new errors pile up. For these codes, decoders with mathematical guarantees exist, but the noise levels they are proven to handle are far below what they handle in practice, and the decoders used in practice have no guarantees.
Status in the literature
Provable circuit-level thresholds exist since 2018 (expander codes) and 2023 (quantum Tanner codes, single-shot); the proven values are orders of magnitude below the numerical ones.
No solutions, ideas or subproblems yet.
See also
Details, signature and history
- Kind
- Well-posed question
- Answer
- Proof
- Topic review
- N. P. Breuckmann and J. N. Eberhardt, Quantum Low-Density Parity-Check Codes, PRX Quantum, 2021. Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- 41736a5614f3…
- Public log
- Entry 2,023, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.