Separations in query complexity using cheat sheets
STOC '16: Symposium on Theory of Computing Cambridge MA USA June, 2016, pp. 863-876, 2016.
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...More
PPT (Upload PPT)