PIRSA Logo


PERIMETER INSTITUTE RECORDED SEMINAR ARCHIVE

PIRSA:13110090  ( MP4 Medium Res , MP3 , PDF ) Which Format?
Quantum Adversary (Upper) Bound
Speaker(s): Shelby Kimmel
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.
Date: 20/11/2013 - 4:00 pm
Valid XHTML 1.0!