Quantum computers can search rapidly by using almost any transformation

@misc{citeulike:2136589, abstract = {A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the Walsh-Hadamard (W-H) transform. This paper shows that this algorithm can be implemented by replacing the W-H transform by almost any quantum mechanical operation. This leads to several new applications where it improves the number of steps by a square-root. It also broadens the scope for implementation since it demonstrates quantum mechanical algorithms that can readily adapt to available technology.}, archivePrefix = {arXiv}, author = {Grover, Lov K.}, citeulike-article-id = {2136589}, eprint = {quant-ph/9712011}, keywords = {algorithms, amplification, amplitude, quantum}, month = {Dec}, posted-at = {2007-12-17 13:59:53}, priority = {5}, title = {Quantum computers can search rapidly by using almost any transformation}, url = {http://arxiv.org/abs/quant-ph/9712011}, year = {1997} }

TY - ELEC ID - citeulike:2136589 L3 - citeulike-article-id:2136589 N2 - A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the Walsh-Hadamard (W-H) transform. This paper shows that this algorithm can be implemented by replacing the W-H transform by almost any quantum mechanical operation. This leads to several new applications where it improves the number of steps by a square-root. It also broadens the scope for implementation since it demonstrates quantum mechanical algorithms that can readily adapt to available technology. TI - Quantum computers can search rapidly by using almost any transformation KW - algorithms KW - amplification KW - amplitude KW - quantum AU - Grover, Lov PY - 1997/Dec/03/ UR - http://arxiv.org/abs/quant-ph/9712011 ER -