Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
