Perturbations Can Enhance Quantum Search
- 41 Downloads
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.
Unable to display preview. Download preview PDF.
- Bae, J. and Kwon, Y. (2002). Physical Review A 66, 012314.Google Scholar
- Bae, J. and Kwon, Y. (2003). Maximum Speedup in Quantum Search, International Journal of Theoretical Physics 42, 2057.Google Scholar
- Bouwmeester, D., Ekert, A., and Zeilinger, A. (2000). The Physics of Quantum Information, Springer, New York.Google Scholar
- Farhi, E. and Gutmann, S. (1998). Physical Review A 57, 2403.Google Scholar
- Grover, L. K. (1997). Physical Review Letters 79, 325.Google Scholar
- Nielsen, M. A. and Chuang, I. L. (2000). Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, MA.Google Scholar
- Oshima, K. (2001). Driving Hamiltonian in a Quantum Search Problem, LANL Report No. quant-ph/0111021.Google Scholar
- Shor, P. (1997). SIAM Journal of Science and Statistical Computation 26, 1484.Google Scholar