Master’s Thesis Presentation • Quantum Computing • A Generalized Adversary Method for Quantum Query Complexity
Please note: This master’s thesis presentation will be given online.
Rory Soiffer, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Shalev Ben-David
Quantum query complexity measures the minimum number of queries a quantum algorithm needs to make to some input string to compute a function of that input. Query complexity models are widely used throughout quantum computing, from setting limits on quantum algorithms to analyzing post-quantum cryptography.