University of Cambridge > Talks.cam > Wednesday Seminars - Department of Computer Science and Technology  > Quantum computing via the lens of additive combinatorics

Quantum computing via the lens of additive combinatorics

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Ben Karniely.

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

A recording of this talk is available at the following link: https://www.cl.cam.ac.uk/seminars/wednesday/video/

This talk is part of the Wednesday Seminars - Department of Computer Science and Technology series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity