A fast quantum mechanical algorithm for database search Lov


Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilis-tic) will need to look at a minimum of names. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names… (More)


2 Figures and Tables

Slides referencing similar topics