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

Simple item page
dc.creatorLong, Gui Lu
dc.date2005-06-15
dc.date.accessioned2026-07-07T06:12:59Z
dc.date.available2026-07-07T06:12:59Z
dc.descriptionIn 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.
dc.descriptionone page comment on quant-ph/0506105
dc.identifierhttps://arxiv.org/abs/quant-ph/0506121
dc.identifierhttp://arxiv.org/abs/quant-ph/0506121
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92957
dc.subjectQuantum Physics
dc.titleComment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search
dc.typetext

Files

Collections

arXiv