An efficient quantum search engine on unsorted database
- 202 Downloads
We consider the problem of finding one or more desired items out of an unsorted database. Patel has shown that if the database permits quantum queries, then mere digitization is sufficient for efficient search for one desired item. The algorithm, called factorized quantum search algorithm, presented by him can locate the desired item in an unsorted database using O(\(log_4N\)) queries to factorized oracles. But the algorithm requires that all the attribute values must be distinct from each other. In this paper, we discuss how to make a database satisfy the requirements, and present a quantum search engine based on the algorithm. Our goal is achieved by introducing auxiliary files for the attribute values that are not distinct, and converting every complex query request into a sequence of calls to factorized quantum search algorithm. The query complexity of our algorithm is O(\(log_4N\)) for most cases.
KeywordsQuantum search model Quantum computation Database search Quantum search algorithm
- 1.Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325–328 (1997)Google Scholar
- 4.Nielson, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)Google Scholar
- 6.Elmasri, R.R., Navathe, S.B.: Fundamentals of Database System. Addison Wesley, Boston (2006)Google Scholar