A note on quantum black-box complexity of almost all Boolean functions

Abstract

We show that, for almost all N-variable Boolean functions f, at least N/4-O(\sqrt{N} log N) queries are required to compute f in quantum black-box model with bounded error.

arXiv comment4 pages, LaTeX

References in corpus (2)

• A Limit on the Speed of Quantum Computation in Determining Parity
• Quantum Lower Bounds by Polynomials