Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > QUANTUM CODES:
Reports tagged with quantum codes:
TR25-136 | 26th September 2025
Sumegha Garg, Akash Sengupta

Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry Codes

We study the robust local testability of tensor products of two Algebraic-Geometry (AG) codes. In particular, we prove that \textit{constant rate} AG codes are robust locally testable. This significantly generalizes the seminal result of Polishchuk-Spielman [PS24], which proved robust local testability of Reed-Solomon codes. We establish an algebraic-geometric framework ... more >>>


TR26-037 | 9th March 2026
Noga Ron-Zewi, Mor Weiss

A Note on the Equivalence Between Zero-knowledge and Quantum CSS Codes

Zero-knowledge codes, introduced by Decatur, Goldreich, and Ron (ePrint 1997), are error-correcting codes in which few codeword symbols reveal no information about the encoded message, and have been extensively used in cryptographic constructions. Quantum CSS codes, introduced by Calderbank and Shor (Phys. Rev. A 1996) and Steane (Royal Society A ... more >>>




ISSN 1433-8092 | Imprint