Discrete Analysis and Complexity of Quantum Algorithms

Organizers: Alexandros Eskenazis (ae466@cam.ac.uk), Paata Ivanisvili (ivanishvili.paata@gmail.com)

ONLINE · October 11–October 15, 2021

This year the summer/fall school took place online due to the pandemic. The total number of participants was limited to 15 (including 2 organizers).

Participants can be graduate students or postdocs interested in learning new challenging problems in complexity of quantum algorithms. Undergraduate students are also welcome to apply.

Each participant will choose a paper from the list and prepare two talks (each 50 minutes long). The first talk will be more introductory, containing the basic definitions and the summary of the results; the second talk will be more about the details of the proofs.

Participants will need to submit a 4–6 page summary of the talk by September 10th, 2021 for proceedings. Here is a sample of the summary written for this paper.

The summer/fall school is funded by the NSF. Ideally we would arrange a meeting in a resort; however, due to the pandemic we decided to make an exception this year and organize the summer/fall school online. Nonlocal (not UCI affiliated) participants based in the US and having SSN will receive a stipend (funded by NSF CAREER DMS-2152401). Application deadline: July 1, 2021. Historical application form: submit your application.

Inspired by the Summer School in Analysis.