![Error-Correcting Codes: Theory and Practice Logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-05/Quantum%20Algorithms%2C%20Complexity%2C%20and%20Fault%20Tolerance.jpg?h=49a0d866&itok=FUjtT9Ai)
Abstract
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