Maximum Speedup in Quantum Search : O(1) Running Time
| dc.creator | Bae, Joonwoo | |
| dc.creator | Kwon, Younghun | |
| dc.date | 2002-04-16 | |
| dc.date | 2003-11-25 | |
| dc.date.accessioned | 2026-07-07T06:03:58Z | |
| dc.date.available | 2026-07-07T06:03:58Z | |
| dc.description | Recently the continuous time algorithm based on the generalized quantum search Hamiltonian was presented. In this letter, 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 the O(1) running time regardless of the number of total states. It seems to violate the proof of Zalka that the quadratic speedup is optimal in quantum search. However the argurment 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. | |
| dc.description | 4 pages, revtex, published version | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0204087 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0204087 | |
| dc.identifier | Int. J. Theor. Phys. Vol. 42, Issue 9, 2069-2074 (2003) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90142 | |
| dc.subject | Quantum Physics | |
| dc.title | Maximum Speedup in Quantum Search : O(1) Running Time | |
| dc.type | text |