A Fast Quantum Mechanical Algorithm for Database Search-英文文献.pdf

A fast quantum mechanical algorithm for database search Lov K. Grover 3C-404A, Bell Labs 600 Mountain Avenue Murray Hill NJ 07974 lkgrover@ Summary This paper applies quantum computing to a mundane problem in information processing and pre- Imagine a phone directory containing N names sents an algorithm that is significantly faster than any arranged in completely random order. In order to find classical algorithm can be. The problem is this: there is 1 someones phone number with a probability of , any an unsorted database containing N items out of which 2 just one item satisfies a given condition - that one item classical algorithm (whether deterministic or probabilis- has to be retrieved. Once an item is examined, it is pos- N sible to tell whether or not it satisfies the condition in tic) will need to look at a minimum of names. Quan- 2 one step. However, there does not exist any sorting on tum mechanical systems