The database search problem
Given an unsorted database containing n items but only one “marked” item, find the address of the marked item with a minimal number of database calls.
Grover’s quantum algorithm uses O(¦n) calls in general, and only one call for a 4-item database.