We present a new paradigm of designing quantum algorithms via a general-purpose machinery for boosting quantum computation. The framework relies on deep mathematical tools including the quasi-polynomial Bogolyubov-Ruzsa lemma and sheds light on an inherent connection between additive combinatorics and the linearity of quantum mechanics. I will also discuss applications to quantum complexity theory, learning, and cryptography.
Link to join virtually: https://cam-ac-uk.zoom.us/j/81322468305
This talk is being recorded.