Today I read a paper titled “A note on quantum black-box complexity of almost all Boolean functions”
The abstract is:
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.