Dinur-Lin-Vidick (DLV) code[1]
Description
Member of a family of codes constructed using cubical chain complexes, which are \(t\)-order extensions of the complexes underlying expander codes (\(t=1\)) and expander lifted-product codes (\(t=2\)).
For \(t=4\), assuming a conjecture about random linear maps, there exists a quantum locally testable family with linear dimension and inverse poly-logarithmic relative distance and soundness. Applying weight reduction yields order \(\Omega(1/\text{polylog}n)\) soundness, \(\Omega(n/\text{polylog}n)\) distance and dimension, and constant locality [2; Table 4]. Applying distance amplification and soundness amplification yields asymptotically constant soundness, order \(\Theta(n)\) distance, order \(\Theta(n)\) dimension, but poly-logarithmic locality [2; Table 4].
Cousin
- Quantum locally testable code (QLTC)— DLV codes have linear dimension and inverse poly-logarithmic relative distance and soundness, assuming a conjecture about random linear maps [1]. Applying distance amplification and soundness amplification yields asymptotically constant soundness, order \(\Theta(n)\) distance, order \(\Theta(n)\) dimension, but poly-logarithmic locality [2; Table 4].
Primary Hierarchy
References
- [1]
- I. Dinur, T.-C. Lin, and T. Vidick, “Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes”, (2025) arXiv:2402.07476
- [2]
- A. Wills, T.-C. Lin, and M.-H. Hsieh, “Tradeoff Constructions for Quantum Locally Testable Codes”, (2024) arXiv:2309.05541
Page edit log
- Victor V. Albert (2026-06-08) — most recent
- Victor V. Albert (2024-02-13)
Cite as:
“Dinur-Lin-Vidick (DLV) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/dlv, arXiv:2606.11484