Advances in quantum query complexity
APA
Ben-David, S. (2016). Advances in quantum query complexity. Perimeter Institute. https://pirsa.org/16100066
MLA
Ben-David, Shalev. Advances in quantum query complexity. Perimeter Institute, Oct. 26, 2016, https://pirsa.org/16100066
BibTex
@misc{ pirsa_PIRSA:16100066, doi = {10.48660/16100066}, url = {https://pirsa.org/16100066}, author = {Ben-David, Shalev}, keywords = {Quantum Information}, language = {en}, title = {Advances in quantum query complexity}, publisher = {Perimeter Institute}, year = {2016}, month = {oct}, note = {PIRSA:16100066 see, \url{https://pirsa.org}} }
Talk Type
Subject
Abstract
I will describe some of the recent progress in quantum query complexity, including super-quadratic separations between classical and quantum measures for total functions, a better understanding of the power of some lower bound techniques, and insight into when we should expect exponential quantum speedups for partial functions.