Some Properties of Quantum Data Search Algorithms
Keisuke Arima, Hiromi Miyajima, Noritaka Shigei, Michiharu Maeda · ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications · 2008
This paper deals with some properties of quantum data search algorithms. First, Grover’s and Ventura’s algorithms for quantum data search are introduced and compared with each other. As a result, it is shown that both algorithms are not always universal with the number of stored data. Further, some properties on the data search algorithms are shown.