Comment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search
量子物理
2007-05-23 v1
摘要
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.
引用
@article{arxiv.quant-ph/0506121,
title = {Comment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search},
author = {Gui Lu Long},
journal= {arXiv preprint arXiv:quant-ph/0506121},
year = {2007}
}
备注
one page comment on quant-ph/0506105