@inproceedings{692ba6fcaf87437882a64170fb6cb06f,
title = "How low can approximate degree and quantum query complexity be for total boolean functions?",
abstract = "It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Omega(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 Omega(log n / log log n), and we exhibit quantum algorithms for two functions where this bound is achieved.",
keywords = "Analysis of Boolean functions, approximate degree, lower bounds, quantum algorithms, query complexity",
author = "Andris Ambainis and \{De Wolf\}, Ronald",
year = "2013",
doi = "10.1109/CCC.2013.26",
language = "English",
isbn = "9780769549972",
series = "Proceedings of the Annual IEEE Conference on Computational Complexity",
pages = "179--184",
booktitle = "Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013",
note = "2013 IEEE Conference on Computational Complexity, CCC 2013 ; Conference date: 05-06-2013 Through 07-06-2013",
}