Separations in query complexity using cheat sheets
Authors:
Open Access
- 19 June 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 863-876
Abstract
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. Finally, we exhibit a total function with a quadratic gap between quantum query complexity and certificate complexity, which is optimal (up to log factors). These separations are shown using a new, general technique that we call the cheat sheet technique, which builds upon the techniques of Ambainis et al. [STOC 2016]. The technique is based on a generic transformation that converts any (possibly partial) function into a new total function with desirable properties for showing separations. The framework also allows many known separations, including some recent breakthrough results of Ambainis et al. [STOC 2016], to be shown in a unified manner.Keywords
All Related Versions
Funding Information
- National Science Foundation (1249349)
- Army Research Office (W911NF-12-1-0486)
This publication has 31 references indexed in Scilit:
- Quantum Walk Algorithm for Element DistinctnessSIAM Journal on Computing, 2007
- Quantum lower bounds for the collision and the element distinctness problemsJournal of the ACM, 2004
- Complexity measures and decision tree complexity: a surveyTheoretical Computer Science, 2002
- Quantum lower bounds by polynomialsJournal of the ACM, 2001
- On the Power of Quantum ComputationSIAM Journal on Computing, 1997
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- On rank vs. communication complexityCombinatorica, 1995
- On the Monte carlo boolean decision tree complexity of read‐once formulaeRandom Structures & Algorithms, 1995
- On the degree of boolean functions as real polynomialscomputational complexity, 1994
- CREW PRAMs and Decision TreesSIAM Journal on Computing, 1991