dorsal/arxiv
View SchemaComment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search
| Authors | Gui Lu Long |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0506121 |
| URL | https://arxiv.org/abs/quant-ph/0506121 |
Abstract
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.
{
"annotation_id": "54fb10f4-ea52-4f39-a2bb-2df81b8c9d06",
"date_created": "2026-03-02T18:02:17.265000Z",
"date_modified": "2026-03-02T18:02:17.265000Z",
"file_hash": "a69f977ef637ef10df6a40dedb65be7816f7092637bda7e99250dc3158007851",
"private": false,
"record": {
"abstract": "In a recent paper (quant-ph/0506105), A S Gupta, M. Gupta and A. Pathak\nproposed a modified Grover algorithm that would exponentially accelerate the\nunsorted database search problem if the number of marked items is known. If\nthis were true, it would represent a major fundamental breakthrough in computer\nscience, mathematics, quantum information and other related branches of\nsciences.\n However the algorithm is not valid. We will explain it in this brief comment.",
"arxiv_id": "quant-ph/0506121",
"authors": [
"Gui Lu Long"
],
"categories": [
"quant-ph"
],
"title": "Comment on quant-ph/0506105: The modified Grover algorithm cannot speedup unsorted database search",
"url": "https://arxiv.org/abs/quant-ph/0506121"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "325750af-c18c-4341-b4fa-a82b407197da",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}