2000 character limit reached
Good Quantum Locally Testable Codes from Product Expansion
Published 22 Sep 2026 in quant-ph, cs.CC, and cs.IT | (2609.26735v1)
Abstract: We construct quantum locally testable codes (LTCs) with constant rate, distance, soundness and locality under a variant of a product expansion conjecture of Bafna and Vyas about Reed-Solomon codes. In particular, we use the high-dimensional expansion framework of Dinur, Lin and Vidick for constructing quantum LTCs, instantiated with the non-Abelian cubical complexes of Rungtanapirom, Stix and Vdovina. Our code is obtained by equipping the complex with carefully chosen Reed-Solomon local codes whose symmetries are compatible with those of the complex.
Paper Prompts
Sign up for free to create and run prompts on this paper.