Maximum Speedup in Quantum Search: O(1) Running Time
- 42 Downloads
We consider the running time of the generalized quantum search Hamiltonian. We provide the surprising result that the maximum speedup of quantum search in the generalized Hamiltonian is an O(1) running time regardless of the number of total states. This seems to violate the proof of Zalka that the quadratic speedup is optimal in quantum search. However the argument of Giovannetti et al. that a quantum speedup comes from the interaction between subsystems (or, equivalently entanglement) (and is concerned with the Margolus and Levitin theorem) supports our result.
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. Note on the generalized quantum search Hamiltonian. Preprint.Google Scholar
- Deutsch, D. (1985). Quantum theory, the Church—Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A 400, 97-117.Google Scholar
- Farhi, E. and Gutmann, S. (1998). Physical Review A 57, 2403.Google Scholar
- Giovannetti, V., Lloyd, S., and Maccone, L. (2002). LANL Report No. quant-ph/0206001.Google Scholar
- Grover, L. K. (1997). Physical Review Letters 79, 325.Google Scholar
- Grover, L. (2002). From coupled pendulums to quantum search. I. Mathematics of Quantum Computation, CRC Press, Boca Raton, FL.Google Scholar
- Margolus, N. and Levitin, L. (1998). Physica D 120, 188-195.Google Scholar
- Zalka, C. (1999). Physical Review A 60, 2748.Google Scholar