Abstract—A quantum computation problem of quantum
search is discussed in this paper. Grover’s search algorithm, the
most commonly used quantum search algorithm, is introduced
in details. The flow of quantum search algorithm and the
quantum circuit model are shown. And the error of the search
value, as well as the probability of measurement, is analyzed.
For further research we simulated the Grover’s search
algorithm in classical computer. By quantum simulator the
probability distribution of the measuring result of search value
is presented and the computational efficiency is discussed. The
simulation result demonstrates the effectiveness of the proposed
Index Terms—Quantum computation, quantum search algorithm, grover's algorithm.
Zhuang Jiayu, Zhao Junsuo, Xu Fanjiang, and Qiao Peng are with the Science and Technology on Integrated Information System Laboratory, Institute of Software Chinese Academy of Sciences, Beijing, China (e-mail: jiayu@ iscas.ac.cn, junsuo@ iscas.ac.cn, fanjiang@ iscas.ac.cn, qiaopeng@ iscas.ac.cn).
Hu Haiying is with Shanghai Engineering Center for Microsatellites, Chinese Academy of Sciences, Shanghai, China.
Cite:Zhuang Jiayu, Zhao Junsuo, Xu Fanjiang, Hu Haiying, and Qiao Peng, "Analysis and Simulation of Grover’s Search Algorithm," International Journal of Machine Learning and Computing vol.4, no. 1, pp. 21-23, 2014.