dorsal/arxiv
View SchemaModified Grover's Search Algorithm in O(M+logN)Steps
| Authors | A. S. Gupta, A. Pathak |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0506093 |
| URL | https://arxiv.org/abs/quant-ph/0506093 |
Abstract
The present letter proposes a modification in the well known Grover's search algorithm, which searches a database of $N$ unsorted items in $O(\sqrt{N/M})$ steps, where $M$ represents the number of solutions to the search problem. Concurrency control techniques and extra registers for marking and storing the solutions are used in the modified algorithm. This requires additional space but it is shown that the use of extra register and marking techniques can reduce the time complexity to $O(M+\log N)$.
{
"annotation_id": "296b1134-a66c-4199-b44b-448ada10deac",
"date_created": "2026-03-02T18:02:17.149000Z",
"date_modified": "2026-03-02T18:02:17.149000Z",
"file_hash": "05b7b331e2a4102a2f0b01e7b279eb499cdb58a7bec6b6461bd2e2f5c5a50914",
"private": false,
"record": {
"abstract": "The present letter proposes a modification in the well known Grover\u0027s search\nalgorithm, which searches a database of $N$ unsorted items in $O(\\sqrt{N/M})$\nsteps, where $M$ represents the number of solutions to the search problem.\nConcurrency control techniques and extra registers for marking and storing the\nsolutions are used in the modified algorithm. This requires additional space\nbut it is shown that the use of extra register and marking techniques can\nreduce the time complexity to $O(M+\\log N)$.",
"arxiv_id": "quant-ph/0506093",
"authors": [
"A. S. Gupta",
"A. Pathak"
],
"categories": [
"quant-ph"
],
"title": "Modified Grover\u0027s Search Algorithm in O(M+logN)Steps",
"url": "https://arxiv.org/abs/quant-ph/0506093"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f8f8ba9d-e551-441f-8136-14074a1b4e59",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}