Abstract

(In order of appearance)

Ruizhe Zhang (Simons Institute)

Title: Early fault-tolerant quantum phase estimation

Abstract: In this talk, I will motivate the study of early fault-tolerant quantum algorithms, which aim to use fewer quantum resources while simultaneously providing provable performance guarantees. As a concrete example, I will introduce the early fault-tolerant quantum phase estimation (QPE), highlighting some recent advances in robustly estimating a Hamiltonian‚Äôs ground state energy and other significant eigenvalues with small quantum circuit depths.

 

Hsin-Po Wang (Simons Institute)

Title: Group Testing and Nested Locally Recoverable Codes

Abstract: Group testing is the art of finding sparse signals using binary tests.  The binary nature of tests  render them suitable for the application codes.  In this talk, we will demonstrate how to use a customized locally recoverable codes to construct a group testing scheme.

 

Roni Con (Technion)

Title: Recent advances in linear codes against insdel and open questions

Abstract: Linear codes are desirable for many reasons: they have a compact representation (they are determined by their generating matrix), they are efficiently encodable, and in some settings, we even have efficient decoding algorithms against symbol erasures and substitutions.
In this short talk, I will describe what is known for linear codes when the errors are synchronization errors, namely, insertions and deletions.

 

Nicolas Resch (Informatics Institute, University of Amsterdam)

Title: Combinatorial Code Questions

Abstract: After briefly introducing some broad themes of my research, I will discuss some recent work related to combinatorial questions about error-correcting codes. For example, what is the maximum radius at which a positive rate code can be list-decodable? If the code does have zero-rate, how large can it be? If you sample a linear code randomly, for what rates can we guarantee that (whp) every Hamming ball of radius pn has at most 3 vectors? And do these results hold for other code ensembles?

 

Fernando Granha Jeronimo (IAS)

Title: A Glimpse of Quantum (Un)Entanglement

Abstract: In this short talk, I will give a flavor of one of my favorite topics: quantum (un)entanglement. Entanglement is a surprisingly rich phenomenon with connections to computational complexity, coding theory, pseudorandomness, etc. Of course, we will only be able to have a bird's-eye view of some of these many connections.

 

Rachel Zhang (MIT)

Title: Noisy Feedback in Codes

Abstract: I'll tell you about one of my favorite open problems in the area of interaction + codes!