Scrapbooks or social networks are collections of mostly unsorted data. The search for single elements in very large data volumes, i.e. for the needle in the data haystack, is extremely complex for classical computers. Scientists have now quantum mechanically implemented and successfully executed Grover's algorithm, a process for the quick finding of a search element in unsorted databases.