Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs
Abstract
For every fixed integers r ≥ 4 and 2 ≤ k ≤ r−2, we construct r-dimensional cubical sheaf complexes whose degree-k CSS codes have positive constant rate, linear distance, and constant soundness, with bounded row and column weights. Taking r=4 and k=2 gives a family of asymptotically good binary qLTCs. At the core of our construction is a uniform product-expansion theorem for explicit Reed-Solomon codes on norm-one evaluation sets. The key point is that the expansion constant stays bounded away from zero as the local code lengths grow. We place these codes on arithmetic cubical complexes, obtaining constant local expansion for both the resulting sheaf and its dual. Together with the local-to-global framework of Dinur, Lin, and Vidick (FOCS 2024) and sheaf duality, this gives linear distance and constant soundness, while an asymmetric choice of local code dimensions gives positive rate. The resulting codes are explicit and polynomial-time computable.
Related
- Good Quantum Locally Testable Codes from Lossless Cubical Complexes
- Cubical residual complexes and profinite rigidity of real hyperbolic lattices
- Strichartz estimates for Klein-Gordon equations on asymptotically hyperbolic manifolds with applications
- Asymptotically optimal bracketing covers for anchored boxes with applications to star discrepancy
- Quasilinear wave equations on asymptotically flat spacetimes with applications to Kerr black holes
BibTeX
@misc{chen2026cubical,
title = {{Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs}},
author = {Yeyuan Chen and Miryam Mi-Ying Huang and Yinchen Liu and Er-Cheng Tang},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.28028},
eprint = {2609.28028},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.28028},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs
AU - Yeyuan Chen
AU - Miryam Mi-Ying Huang
AU - Yinchen Liu
AU - Er-Cheng Tang
PY - 2026
DA - 2026/09/23
PB - arXiv
DO - 10.48550/arxiv.2609.28028
UR - https://arxiv.org/abs/2609.28028
AB - For every fixed integers r ≥ 4 and 2 ≤ k ≤ r−2, we construct r-dimensional cubical sheaf complexes whose degree-k CSS codes have positive constant rate, linear distance, and constant soundness, with bounded row and column weights. Taking r=4 and k=2 gives a family of asymptotically good binary qLTCs. At the core of our construction is a uniform product-expansion theorem for explicit Reed-Solomon codes on norm-one evaluation sets. The key point is that the expansion constant stays bounded away from zero as the local code lengths grow. We place these codes on arithmetic cubical complexes, obtaining constant local expansion for both the resulting sheaf and its dual. Together with the local-to-global framework of Dinur, Lin, and Vidick (FOCS 2024) and sheaf duality, this gives linear distance and constant soundness, while an asymmetric choice of local code dimensions gives positive rate. The resulting codes are explicit and polynomial-time computable.
ER -