Abstract
In general, a quantum algorithm wants to avoid decoherence or perturbation, since such factors may cause errors in the algorithm. We show that some perturbations to the generalized quantum search Hamiltonian can reduce the running time and enhance the success probability. We also provide the narrow bound to the perturbation which can be beneficial to quantum search. In addition, we show that the error induced by a perturbation on the Farhi and Gutmann Hamiltonian can be corrected by another perturbation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bae, J. and Kwon, Y. (2002). Physical Review A 66, 012314.
Bae, J. and Kwon, Y. (2003). Maximum Speedup in Quantum Search, International Journal of Theoretical Physics 42, 2057.
Bouwmeester, D., Ekert, A., and Zeilinger, A. (2000). The Physics of Quantum Information, Springer, New York.
Farhi, E. and Gutmann, S. (1998). Physical Review A 57, 2403.
Grover, L. K. (1997). Physical Review Letters 79, 325.
Nielsen, M. A. and Chuang, I. L. (2000). Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, MA.
Oshima, K. (2001). Driving Hamiltonian in a Quantum Search Problem, LANL Report No. quant-ph/0111021.
Shor, P. (1997). SIAM Journal of Science and Statistical Computation 26, 1484.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bae, J., Kwon, Y. Perturbations Can Enhance Quantum Search. International Journal of Theoretical Physics 42, 2075–2080 (2003). https://doi.org/10.1023/A:1027343321366
Issue Date:
DOI: https://doi.org/10.1023/A:1027343321366