Quantum Computers Can Search Arbitrarily Large Databases by a Single Query

This paper shows that a quantum mechanical algorithm that can query relating to multiple items of the database, can search a database a single query (a query is defined as any question to the database to which database has to return a (YES/NO) answer). A classical algorithm will be to the information theoretic bound of at least O(log N) queries (which would achieve by using a binary search).