Maximum Speedup in Quantum Search : O(1) Running Time

Details Maximum Speedup in Quantum Search : O(1) Running Time Maximum Speedup in Quantum Search : O(1) Running Time

2002-04-16

arxiv.org/abs/quant-ph/0204087v2

Int. J. Theor. Phys. Vol. 42, Issue 9, 2069-2074 (2003)

Physics

Quantum Physics

4 pages, revtex, published version

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Maximum Speedup in Quantum Search : O(1) Running Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum Speedup in Quantum Search : O(1) Running Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum Speedup in Quantum Search : O(1) Running Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-11512