Quantum search on structured problems
Quantum Physics
2015-06-26 v1
Abstract
This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a square-root - a simple minded search that takes N steps, can be improved to O(sqrt(N)) steps. The quantum search algorithm is one of several immediate consequences of this framework. Several novel search-related applications are presented.
Cite
@article{arxiv.quant-ph/9802035,
title = {Quantum search on structured problems},
author = {Lov K. Grover},
journal= {arXiv preprint arXiv:quant-ph/9802035},
year = {2015}
}
Comments
To be presented at the 1st NASA QCQC conference in Palm Springs, California, Feb. 17-20, '98. 12 pages, postscript