You will have 25 minutes to give your presentation, with 5 minutes for questions. You are encouraged to give a computer presentaton; a data projector will be available. Presentations will be during the last two class meetings (2 and 4 April), with an additional hour on Thursday. See below for a detailed schedule.
Your paper is due on Tuesday 11 April. It should be typeset in LaTeX and submitted by email as a PDF file. There are no length requirements, but as a rule of thumb, your paper should probably be around 10 pages.
The following is a list of some potential topics, with one or two key references for each. Of course, this list is necessarily incomplete. New topics may be added as the term progresses, and you are also welcome to choose a topic not on this list.
| Time | Speaker | Topic |
|---|---|---|
| Tuesday 2 April | ||
| 2:30 | Vincent Russo | Quantum algorithms for linear equations |
| 3:00 | Young Han | Quantum query algorithms using nested quantum walks |
| 3:30 | Shitikanth Kashyap | Testing symmetric properties of distributions |
| Thursday 4 April | ||
| 2:30 | Stacey Jeffery | Understanding the need for structure in quantum speedups using representations |
| 3:00 | Srinivasan Arunachalam | Quantum algorithms for solvable groups |
| 3:30 | Brandon Weir | The dihedral HSP and learning with errors |
| 4:00 | Alex Valtchev | Search on a grid and the quantum walk search framework |
| 4:30 | Zak Webb | Limitations on quantum algorithms for symmetric functions |