Alumni

Monday, January 4, 2016 2:30 pm - 2:30 pm EST (GMT -05:00)

Colloquium: Shalev Ben-David

Separations in query complexity using cheat sheets

Shalev Ben-David, Massachusetts Institute of Technology (MIT)

We show a power 2.5 separation between bounded-error randomized and quantum query complexity for a total Boolean function, refuting the widely believed conjecture that the best such separation could only be quadratic (from Grover's algorithm). We also present a total function with a power 4 separation between quantum query complexity and approximate polynomial degree, showing severe limitations on the power of the polynomial method.

Researchers in Canada, the United States and Europe led by the National Institute of Standards and Technology in Boulder, Colorado and Institute for Quantum Computing alumnus Krister Shalm have ruled out classical theories of correlation with remarkably high precision. A group including Institute for Quantum Computing members Evan Meyer-Scott, Yanbao Zhang, Thomas Jennewein, and alumnus Deny Hamel built and performed an experiment that shows the world is not governed by local realism.

Computer scientists, including Institute for Quantum Computing (IQC) members John Watrous and Richard Cleve have long been looking at protocols where quantum communication offers an advantage compared to the classical case. However technology hasn’t progressed as quickly, so researchers had previously been unable to implement the protocols.

Four professors from the University of Waterloo are among the new fellows of the Royal Society of Canada (RSC) announced today, peer-elected as the best in their field.

The fellowship of the RSC consists of individuals who have made outstanding contributions in the arts, the humanities, science, and Canadian public life.