Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > CUBICAL COMPLEX:
Reports tagged with cubical complex:
TR26-240 | 1st October 2026
Eshan Chattopadhyay, Noam Ringach, Nicholas Spooner

Two-Sided Product Expanding Codes via Rademacher Matrices

Beginning with the work of Dinur, Lin, and Vidick (FOCS, 2024), tensor codes with constant product expansion have been foundational to recent advances in quantum locally testable codes (qLTCs) based on cubical complexes. Informally, product expansion says that any low-weight parity check of the tensor code can be written as ... more >>>




ISSN 1433-8092 | Imprint