arXiv:2609.28028
Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs
Yeyuan Chen, Miryam Mi-Ying Huang, Yinchen Liu, Er-Cheng Tang
Abstract
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.
AI Summary
The paper addresses whether binary quantum locally testable codes can simultaneously have constant rate, linear distance, constant soundness, and bounded check weights and qubit degrees. It constructs explicit, polynomial-time computable families claiming all these properties: $[[N,K,D,\rho]]$ with $K=\Omega(N)$, $D=\Omega(N)$, and $\rho=\Omega(1)$. More generally, the construction works on $r$-dimensional cubical sheaf complexes for every fixed $r\ge4$ and $2\le k\le r-2$; $r=4,k=2$ gives the binary application. The stated rate lower bound is $K/N\ge[2\binom{r}{k}2^{r-k}]^{-1}$, hence $1/48$ in that case. The main coding ingredient is product expansion for Reed–Solomon codes evaluated on norm-one sets of lengths $q_i+1$, where $q_i=2^{2(A+i)}$. For relative redundancies at least $\beta$, every nonempty subtuple has expansion at least $c_r\beta^r$, independently of $A$. The proof enlarges supports to polynomial hulls and establishes inner generation using Frobenius-based derivative isolation and cylinder gluing. Frobenius-twisted local codes descend to arithmetic quotients of products of trees, whose parallel-face graphs satisfy $\lambda\le\max_i2\sqrt{q_i}/(q_i+1)$. DLV local-to-global expansion and sheaf duality supply distance and soundness; asymmetric local dimensions supply rate. The guarantees are asymptotic, with constants depending on fixed local parameters. Logical gates are not studied. The norm-one expansion theorem does not resolve the distinct Bafna–Vyas conjecture, and the paper notes concurrent constructions of good qLTCs.
the main construction and technical ideas in the current paper were generated with GPT-6 Astra on September 7th
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.