Exactness of the Original Grover Search Algorithm
Quantum Physics
2015-05-20 v1
Abstract
It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.
Cite
@article{arxiv.1010.3652,
title = {Exactness of the Original Grover Search Algorithm},
author = {Zijian Diao},
journal= {arXiv preprint arXiv:1010.3652},
year = {2015}
}
Comments
8 pages, 2 figures