Select All
PIRSA:13110090

Quantum Adversary (Upper) Bound

APA

Kimmel, S. (2013). Quantum Adversary (Upper) Bound. Perimeter Institute for Theoretical Physics. https://pirsa.org/13110090

Shelby Kimmel Massachusetts Institute of Technology (MIT)

Talk numberPIRSA:13110090
Source RepositoryPIRSA

Abstract

I discuss a technique - the quantum adversary upper bound - that uses the structure of quantum algorithms to gain insight into the quantum query complexity of Boolean functions. Using this bound, I show that there must exist an algorithm for a certain Boolean formula that uses a constant number of queries. Since the method is non-constructive, it does not give information about the form of the algorithm. After describing the technique and applying it to a class of functions, I will outline quantum algorithms that match the non-constructive bound.