[Jump to code hierarchy]

Dinur-Lin-Vidick (DLV) code [1]

Description

Member of a family of CSS codes defined by the degree-\(k\) cochains of a tensor-product sheaf on a \(t\)-dimensional cubical complex [1]. The complexes are \(t\)-order extensions of those underlying expander codes (\(t=1\)) and expander lifted-product codes (\(t=2\)).

The vertices of the complex are the elements of a finite set paired with a color in \(\{0,1\}^t\). The edges of each of the \(t\) directions are generated by an inverse-closed set of permutations. Permutations from different directions commute either pairwise [1; Sec. 3] or as sets with unique factorization [2; Def. 2.5], so that one edge in each of several directions at a vertex determines a unique cube. Each direction carries a local classical code, the same at every vertex up to a permutation and rescaling of coordinates [2; Prop. 4.6]. Ref. [3; Sec. 2] allows any regular cubical complex, with local codes given in local coordinate charts and depending on the endpoint color in each direction. A cell spanning the directions in \(I\) carries the tensor product of the local codes of the directions outside \(I\). Qubits sit on the degree-\(k\) cochains, with \(X\) and \(Z\) checks given by the coboundary maps out of and into degree \(k\). For \(2\leq k\leq t-2\), sufficient spectral expansion of the complex, together with product expansion of the local codes and their duals, yields linear distance and constant soundness [1,2].

The strict definition of Ref. [1; Sec. 3] takes the pairwise-commuting option and one fixed local code at every vertex in each direction. The explicit construction takes the complex to be an Abelian lift of a product of expander graphs [1; Sec. 3.5]. Its directional graphs split into disjoint expanders and so expand only on sets of inverse-polylogarithmic density [1; Sec. 3.5]. For \(t=4\), this yields a quantum locally testable family with linear dimension and inverse poly-logarithmic relative distance and soundness [1]. Applying weight reduction yields order \(\Omega(1/polylogn)\) soundness, \(\Omega(n/polylogn)\) distance and dimension, and constant locality [4; Table 4]. Applying distance amplification and soundness amplification yields asymptotically constant soundness, order \(\Theta(n)\) distance, order \(\Theta(n)\) dimension, but poly-logarithmic locality [4; Table 4].

Cousin

  • Quantum locally testable code (QLTC)— DLV codes with Abelian-lift complexes have linear dimension and inverse poly-logarithmic relative distance and soundness [1]. Applying distance amplification and soundness amplification yields asymptotically constant soundness, order \(\Theta(n)\) distance, order \(\Theta(n)\) dimension, but poly-logarithmic locality [4; Table 4].

Primary Hierarchy

Parents
DLV codes are quantum generalized homological product CSS codes whose underlying chain complex is a cubical chain complex, i.e., a \(t\)-order extension of the complexes underlying expander codes (\(t=1\)) and expander lifted-product codes (\(t=2\)) [1].
Dinur-Lin-Vidick (DLV) code
Children
Reed-Solomon cubical sheaf codes are DLV codes with projective Reed-Solomon local codes on an arithmetic quotient of a product of Bruhat-Tits trees. Uniform product expansion of the local codes and Ramanujan expansion of the quotient remove the polylogarithmic losses in distance and soundness of the Abelian-lift DLV construction [2,3].

References

  1. [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. [2]

    Y. Chen, M. M.-Y. Huang, Y. Liu, and E.-C. Tang, “Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs”, (2026) arXiv:2609.28028

  3. [3]

    W. Gay and F. G. Jeronimo, “Asymptotically Good Quantum Locally Testable Codes”, (2026) arXiv:2609.20780

  4. [4]

    A. Wills, T.-C. Lin, and M.-H. Hsieh, “Tradeoff Constructions for Quantum Locally Testable Codes”, (2024) arXiv:2309.05541

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: dlv

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
BibTeX:
@incollection{eczoo_dlv,
title={Dinur-Lin-Vidick (DLV) code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/dlv}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/dlv

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

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qubits/stabilizer/qldpc/other_product/dlv.yml.