Abstract
This paper presents an improved Grover searching algorithm [1] which can auto-control the iterative processing when the number of target states is unknown. The final amplitude of the target states will be decreased if this number is unknown. So the question is how to perform Grover searching algorithm without the number of target states? As for this question, there are two conventional solutions. One solution tries to find the number of target states before performing the original algorithm. The other solution guesses a random k as the number of target states before performing the original algorithm. Both the two solutions need \(O(\sqrt{N})\) additional times Oracle calls than original algorithm and the answer of the first solution is non-deterministic while the second solution needs to check the correctness of the result. Assuming an operator which can judge the sign of the phases of superposition state, based on this technical, this paper shows a novel solution, which can perform Grover searching algorithm even if the number of target states is unknown. This solution only needs adding one gate, which can judge the sign of phase, and one more time Oracle call than the original algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp. 212–219. ACM Press, New York (1996)
Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science, pp. 124–134. IEEE Press, New York (1994)
Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325–328 (1997)
Grover, L.K.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80(19), 4329–4332 (1998)
Long, G.L., Li, Y.S., Zhang, W.L., et al.: Dominant gate imperfection in Grover’s quantum search algorithm. Phys. Rev. A 61(4), 042305 (2000)
Biron, D., Biham, O., Biham, E., Grassl, M., Lidar, D.A.: Generalized grover search algorithm for arbitrary initial amplitude distribution. In: Williams, C.P. (ed.) QCQC 1998. LNCS, vol. 1509, pp. 140–147. Springer, Heidelberg (1999)
Chuang, I.L., Gershenfeld, N., Kubinec, M.: Experimental implementation of fast quantum searching. Phys. Rev. Lett. 80(15), 340–3411 (1998)
Boyer, M., Brassard, G., Høyer, P., et al.: Tight bounds on quantum searching. ArXiv: quant-ph/9605034 (1996)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Daniel, R., Daniel, N., Vladimir, B.: Quantum walks. Acta Phys. Slovaca 61(6), 603–725 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhu, W., Chen, H., Liu, Z., Xue, X. (2014). Grover Algorithm for Multi-objective Searching with Iteration Auto-controlling. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds) Advances in Swarm Intelligence. ICSI 2014. Lecture Notes in Computer Science, vol 8794. Springer, Cham. https://doi.org/10.1007/978-3-319-11857-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-11857-4_41
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11856-7
Online ISBN: 978-3-319-11857-4
eBook Packages: Computer ScienceComputer Science (R0)