dorsal/arxiv
View SchemaQuantum Search Algorithm with more Reliable Behaviour using Partial Diffusion
| Authors | Ahmed Younes, Jon Rowe, Julian Miller |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0312022 |
| URL | https://arxiv.org/abs/quant-ph/0312022 |
| DOI | 10.1063/1.1834408 |
| Journal | Proceedings of the Seventh International Conference on Quantum Communication, Measurement and Computing, pp. 171 -- 174 (2004) |
Abstract
In this paper, we will use a quantum operator which performs the inversion about the mean operation only on a subspace of the system ({\it Partial Diffusion Operator}) to propose a quantum search algorithm runs in $O(\sqrt N/M})$ for searching unstructured list of size $N$ with $M$ matches such that, $1\le M \le N$. We will show that the performance of the algorithm is more reliable than known quantum search algorithms especially for multiple matches within the search space. A performance comparison with Grover's algorithm will be provided.
{
"annotation_id": "818d5653-7586-4b6b-9a5f-98077bcea7ab",
"date_created": "2026-03-02T18:02:03.592000Z",
"date_modified": "2026-03-02T18:02:03.592000Z",
"file_hash": "5e74dbffe1a1059ebd26bcbc46df3fcf1b7ca4556d1a5468ca584779d8e6b3f7",
"private": false,
"record": {
"abstract": "In this paper, we will use a quantum operator which performs the inversion\nabout the mean operation only on a subspace of the system ({\\it Partial\nDiffusion Operator}) to propose a quantum search algorithm runs in $O(\\sqrt\nN/M})$ for searching unstructured list of size $N$ with $M$ matches such that,\n$1\\le M \\le N$. We will show that the performance of the algorithm is more\nreliable than known quantum search algorithms especially for multiple matches\nwithin the search space. A performance comparison with Grover\u0027s algorithm will\nbe provided.",
"arxiv_id": "quant-ph/0312022",
"authors": [
"Ahmed Younes",
"Jon Rowe",
"Julian Miller"
],
"categories": [
"quant-ph"
],
"doi": "10.1063/1.1834408",
"journal_ref": "Proceedings of the Seventh International Conference on Quantum\n Communication, Measurement and Computing, pp. 171 -- 174 (2004)",
"title": "Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion",
"url": "https://arxiv.org/abs/quant-ph/0312022"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a6cdcc8d-5aed-41ab-8a8c-9bba22183686",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}