A note on quantum black-box complexity of almost all Boolean functions
classification
🪐 quant-ph
cs.CC
keywords
almostblack-boxbooleanfunctionsquantumboundedcomplexitycompute
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.