Existence of good quantum locally testable codes
40No. 1,194 in all physics · No. 54 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.
A locally testable code lets a checker detect a corrupted message by looking at a few randomly chosen checks, with failure probability growing with the amount of corruption. Quantum versions with good size and error tolerance would be a step toward the quantum PCP conjecture, and their existence is open.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
Almost-good qLTCs (constant rate, inverse-polylog distance and soundness) were constructed in 2024, with the rate analysis corrected in a 2025 revision.
No solutions, ideas or subproblems yet.
See also
Details, signature and history
- Kind
- Well-posed question
- Answer
- Yes no
- Topic review
- D. Aharonov, I. Arad and T. Vidick, The Quantum PCP Conjecture, SIGACT News (arXiv), 2013. Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- 947521eaeb31…
- Public log
- Entry 2,006, 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.