Skip to main content
Log in

An efficient quantum search engine on unsorted database

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325–328 (1997)

    Google Scholar 

  2. Childs, A.M., Landahl, A.J., Parrilo, P.A.: Quantum algorithms for the ordered search problem via semidefinite programming. Phys. Rev. A 75, 032335 (2007)

    Article  ADS  Google Scholar 

  3. Patel, A.: Quantum database search can do without sorting. Phys. Rev. A 64, 034303 (2001)

    Article  ADS  Google Scholar 

  4. Nielson, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    Google Scholar 

  5. Giovannetti, V., Lloyd, S., Maccone, L.: Quantum random access memory. Phys. Rev. Lett. 100, 160501 (2008)

    Article  MathSciNet  ADS  Google Scholar 

  6. Elmasri, R.R., Navathe, S.B.: Fundamentals of Database System. Addison Wesley, Boston (2006)

    Google Scholar 

  7. Jin, W.L., Chen, X.D.: A desired state can not be found with certainty for Grover’s algorithm in a possible three-dimensional complex subspace. Quantum Inf. Process. 10, 419–429 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jin, W.L.: Quantum search in a possible three-dimensional complex subspace. Quantum Inf. Process. 11, 41–54 (2012)

    Article  MathSciNet  ADS  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fang Liu.

Additional information

The work is supported by the National Natural Science Foundation of China under Grant No. 61173050 and No. U1233119.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, S., Zhang, Y. & Liu, F. An efficient quantum search engine on unsorted database. Quantum Inf Process 12, 3265–3274 (2013). https://doi.org/10.1007/s11128-013-0599-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-013-0599-4

Keywords

Navigation