Abstract
In standard Grover’s algorithm for quantum searching, the probability of finding a marked state is not exactly 1, and some modified versions of Grover’s algorithm that search a marked state from an evenly distributed database with full successful rate have been presented. In this article, we present a generalized quantum search algorithm that searches M marked states from an arbitrary distributed N-item quantum database with a zero theoretical failure rate, where N is not necessary to be the power of 2. We analyze the general properties of our search algorithm, we find that our algorithm has periodicity with a period of 2J + 1, and it is effective with certainty for J + (2J + 1)m times of iteration, where m is an arbitrary nonnegative number.
Similar content being viewed by others
References
Deutsch, D., Josza, R.: Rapid solution of problems by quantum computation. Proc. Royal Soc. London A 439, 553–558 (1992)
Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, pp. 124–134 (1994)
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Symposium on the Foundations of Computer Science, pp. 212–219 (1996)
Bennett, C.H., Bernstein, E., Vazirani, U., et al.: Strengths and weakesses of quantum computing. SIAM J. Comput. 26, 1510–1523 (1997)
Simon, D.: On the power of quantum computation. In: Proceedings of 35th Annual Symposium on Foundations of Computer Science, pp. 116–123 (1994)
Brassard, G., Hoyer, P., Tapp, A.: Quantum counting. In: Automata, Languages and Programming Lecture Notes in Computer Science, vol. 1443, pp. 820–831 (1998)
Mosca, M.: Quantum searching, counting and amplitude amplification. In: Proceedings of International Workshop in Randomized Algorithms, pp. 90–100 (1998)
Grover, L.K.: Quantum computer can search rapidly by using almost any transformation. Phys. Rev. Lett. 80, 4329–4332 (1998)
Boyer, M., Brassard, G., Hoyer, P., et al.: Tight bounds on quantum searching. Fortschr. Phys. 46, 493–505 (1998)
Brassard, G., Hoyer, P., Mosca, M., et al.: Quantum amplitude amplification and estimation. AMS Contemp. Math. Ser. 305, 53–84 (2002)
Biron, D., Biham, O., Biham, E., et al.: Generalized Grover search algorithm for arbitrary initial amplitude distribution. In: Lecture Notes in Computer Science, vol. 1509, pp. 140147 (1999)
Biham, E., Biham, O., Biron, D., et al.: Analysis of generalized Grover quantum search algorithm using recursion equations. Phys. Rev. A 63(01), 2310 (2001)
Long, G.L., Zhang, W.L., Li, Y.S., et al.: Arbitrary phase rotation of the marked state can not be used for Grover’s quantum search algorithm. Commun. Theor. Phys. 32, 335–338 (1999)
Long, G.L., Li, Y.S., Zhang, W.L., et al.: Phase matching in quantum searching. Phys. Lett. A 262, 27–34 (1999)
Long, G.L., Xiao, L., Sun, Y.: Phase matching condition for quantum search with a generalized quantum database. Phys. Lett. A 294, 143–152 (2002)
Long, G.L., Tu, C.C., Li, Y.S., et al.: An SO(3) picture for quantum searching. Phys. Lett. A 34, 861–866 (2001)
Long, G.L.: Grover algorithm with zero theoretical rate. Phys. Lett. A 64(02), 2301 (2001)
Wang, X., Bao, W.S., Fu, X.Q.: A quantum algorithm for searching a target solution of fixed weight. China Sci. Bull. 56, 484–488 (2011)
Zhong, P.C., Bao, W.S.: Quantum mechanical meet-in-the-middle search algorithm for Triple-DES. China Sci. Bull. 55, 321–325 (2010)
Hao, L., Li, J.L., Long, G.L.: Eavesdropping in a quantum secret sharing protocol based on Grover algorithm and its solution. Sci. China Phys. Mech. Astron. 53, 491–495 (2010)
Liu, Y., Ouyang, X.P.: A quantum algorithm that deletes marked states from an arbitrary database. China Sci. Bull. 58, 2329–2333 (2013)
Hao, L., Liu, D., Long, G.L.: An N/4 fixed-point duality quantum search algorithm. Sci. China Phys. Mech. Astron. 53, 1765–1768 (2010)
Hao, L., Long, G.L.: Experimental implementation of a fixed-point duality quantum search algorithm in the nuclear magnetic resonance quantum system. Sci. China Phys. Mech. Astron. 54, 936–941 (2011)
Liu, Y.: Deleting a marked state in quantum database in a duality computing mode. China Sci. Bull. 58, 2927–2931 (2013)
Hoyer, P.: Arbitrary phases in quantum amplitude amplification. Phys. Rev. A 62(05), 2304 (2000)
Long, G.L., Sun, Y.: Efficient scheme for initializing a quantum register with an arbitrary superposed state. Phys. Rev. A 64, 014303 (2001)
Acknowledgment
This work was supported by “the Fundamental Research Funds for the Central Universities” (12QN25).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, Y. An Exact Quantum Search Algorithm with Arbitrary Database. Int J Theor Phys 53, 2571–2578 (2014). https://doi.org/10.1007/s10773-014-2055-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10773-014-2055-3