We will present a construction of quantum locally testable code with optimal parameters up to polylogs. This construction is a natural generalization of the Sipser-Spielman expander codes, as well as the recent breakthroughs by Dinur et al. and Panteleev and Kalachev on qLDPC codes and classical locally testable codes. https://arxiv.org/abs/2402.07476

Video Recording