UvA-DARE (Digital Academic Repository) Optimal quantum query bounds for almost all Boolean functions
9 citations20 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRThis work shows that almost all n -bit Boolean functions have bounded-error quantum query complexity at least n/ 2, up to lower-order terms, and shows that van Dam’s oracle interrogation is essentially optimal for almost all functions. (Semantic Scholar)