Complexity seminar
Quantum Adversary Bound
Alexander Belov
University of Latvia
Friday, 15. December 2017 - 13:30 to 15:00
in IM, rear building, ground floor
In this talk, I will briefly describe the quantum adversary bound, which is an
intriguing way of characterising quantum query complexity, and sketch some of its applications.
No prior knowledge of quantum computation is required.