A note on quantum black-box complexity of almost all Boolean functions
<|reference_start|>A note on quantum black-box complexity of almost all Boolean functions: 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.<|reference_end|>
@article{ambainis1998a,
    title={A note on quantum black-box complexity of almost all Boolean functions},
    author={Andris Ambainis},
    journal={Inform.Proc.Lett. 71 (1999) 5-7},
    year={1998},
    archivePrefix={arXiv},
    eprint={quant-ph/9811080},
    primaryClass={quant-ph cs.CC}
}