Exact quantum lower bound for Grover's problem (pp0533-0540)
          Catalin Dohotaru and Peter Hoyer
          doi: https://doi.org/10.26421/QIC9.5-6-12
Abstracts: One of the most important quantum algorithms ever discovered is Grover’s algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover’s algorithm is exactly optimal. Similar to existing methods for proving lower bounds, we bound the amount of information we can gain from a single oracle query, but we bound this information in terms of angles. This allows our proof to be simple, self-contained, based on only elementary mathematics, capturing our intuition, while obtaining at the same time an exact bound. 
Key words: Quantum computing. Lower bound. Grover’s algorithm. Decision trees.