Comment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search

Details Comment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search Comment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search

2005-06-15

arxiv.org/abs/quant-ph/0506121v1

Physics

Quantum Physics

one page comment on quant-ph/0506105

Scientific paper

In a recent paper (quant-ph/0506105), A S Gupta, M. Gupta and A. Pathak proposed a modified Grover algorithm that would exponentially accelerate the unsorted database search problem if the number of marked items is known. If this were true, it would represent a major fundamental breakthrough in computer science, mathematics, quantum information and other related branches of sciences. However the algorithm is not valid. We will explain it in this brief comment.

Affiliated with

Also associated with

No associations

Rating

Comment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search 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 Comment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-289131