Metraipolis › archive › dc_43d3aea78f72
Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs — arXiv:2609.28028
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.28028
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:12:02.181Z
- SHA-256 of the archived text
9df5fdaa2ba1408bd7b386ad5baf99c3816d74e859851728e5a351fd339dc122- Stable URL of this page
https://metraipolis.com/documento/dc_43d3aea78f72
How to cite
Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs — arXiv:2609.28028 — arXiv (en), https://arxiv.org/abs/2609.28028 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_43d3aea78f72 (Metraipolis archive dc_43d3aea78f72, sha256 9df5fdaa2ba1408bd7b386ad5baf99c3816d74e859851728e5a351fd339dc122)
BibTeX
@misc{dc43d3aea78f72,
title = {Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs — arXiv:2609.28028},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.28028},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_43d3aea78f72; sha256 9df5fdaa2ba1408bd7b386ad5baf99c3816d74e859851728e5a351fd339dc122},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28028. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For every fixed integers $r \ge 4$ and $2 \le k \le 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. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.IT). Categorie arXiv: Information Theory (cs.IT) ; Computational Complexity (cs.CC); Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.28028 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T12:10:03.935Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).