Quantum Fridays: Clement Cannone -- Proving hardness results for quantum algorithms

Quantum Fridays will kick off with an exposition by Clement Canonne on lower bound
techniques to prove hardness results for quantum algorithms: the polynomial and
adversary methods, Zhandry, and Belovs.  

Useful references are Lectures 11, 12, 13 here:
https://www.cs.cmu.edu/~odonnell/quantum15/ 

plus a recent paper by Belovs: https://arxiv.org/abs/2604.05133 

The talks will be somewhat technical, but still accessible to everyone.