Thesis Defenses
 |
Thesis Defense: Prashant Vasudevan: Fine-Grained Cryptography Monday, July 16, 2018 - 2:45pm to 3:15pm Abstract: |
 |
Thesis Defense, Sunoo Park: Cryptography for Societal Benefit Monday, May 7, 2018 - 1:15pm to 2:15pm The deployment of cryptography in society has a range of effects that are not always evident when studying cryptography as a technical construct in |
 |
Shalev Ben-David: Thesis Defense: Quantum Speedups in Query Complexity Thursday, June 29, 2017 - 3:00pm to 4:30pm Abstract:
In this thesis, we study randomized and quantum algorithms in the query complexity model. We investigate when and by how much quantum algorithms provide a speedup over the best possible classical algorithm in the query complexity setting. |
 |
Adam Bouland: Thesis Defense: The space around BQP Friday, June 30, 2017 - 3:00pm to 4:30pm Abstract: |
 |
Alex Arkhipov: Quantum Computation with Identical Bosons Wednesday, June 28, 2017 - 2:00pm to 3:30pm Abstract: A central goal of quantum complexity theory is to prove the computational advantage of quantum mechanics over classical. This talk will discuss such evidence for linear optical systems. |
