Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
This Computer Science/Discrete Mathematics Seminar talk explores the challenge of implementing fault-tolerant non-Clifford quantum gates, which are essential for quantum computing in noisy environments. Learn how Louis Golowich from UC Berkeley presents significant breakthroughs in reducing the asymptotic overhead of these gates through novel quantum error-correcting code constructions. Discover the first asymptotically good codes supporting transversal non-Clifford gates, as well as low-weight parity-check codes with almost linear dimension and polynomial distance. The presentation combines concepts from algebraic codes, expander graphs, and topological techniques to address a fundamental challenge in quantum computing. No prior knowledge of quantum computing is required to follow this talk, which is based on joint research with Venkatesan Guruswami and Ting-Chun Lin.
