Joint IQIM/AWS Seminar Series

Abstract: I will describe recent progress in the field of quantum LDPC codes and focus on a ``simple'' construction of asymptotically good quantum LDPC codes called quantum Tanner codes. These codes achieve a constant encoding rate and display a linear minimum distance, meaning that they can correct adversarial errors of weight linear in the code length. They also come with an efficient decoder and are a promising approach to drastically reduce the overhead required for quantum fault tolerance.

Beyond quantum computing, good quantum LDPC codes find applications in various fields, and were notably instrumental in resolving the NLTS conjecture.

(joint work with Gilles Zémor)

References:

https://arxiv.org/abs/2202.13641 (FOCS 2022)

https://arxiv.org/abs/2206.07571 (SODA 2023)

https://arxiv.org/abs/2208.05537 (to appear in IEEE IT)

This week's seminar will be presented by zoom:

https://caltech.zoom.us/j/88407627311?pwd=RGx4MlpSUnBLbDJvdE4rS1FHbWZvUT09

Meeting ID: 884 0762 7311
Passcode: 932356