Liva Garkaje

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. This is why Boolean functions are needed with a high number of essential variables and a(More)
  • 1