A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Ω(log n), and that this bound is achieved for some functions. In this paper we study the case of approximate degree and bounded-error quantum query complexity. We show that for these measures the correct lower bound is Ω(log n/ log log n), and we exhibit quantum algorithms for two functions where this bound is achieved.doi:10.1109/ccc.2013.26 dblp:conf/coco/AmbainisW13 fatcat:mfjmjs64s5ckxfjf5xeomgfnxu