dorsal/arxiv
View SchemaEffects of Noisy Oracle on Search Algorithm Complexity
| Authors | Neil Shenvi, Kenneth R. Brown, K. Birgitta Whaley |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0304138 |
| URL | https://arxiv.org/abs/quant-ph/0304138 |
| DOI | 10.1103/PhysRevA.68.052313 |
Abstract
Grover's algorithm provides a quadratic speed-up over classical algorithms for unstructured database or library searches. This paper examines the robustness of Grover's search algorithm to a random phase error in the oracle and analyzes the complexity of the search process as a function of the scaling of the oracle error with database or library size. Both the discrete- and continuous-time implementations of the search algorithm are investigated. It is shown that unless the oracle phase error scales as O(N^(-1/4)), neither the discrete- nor the continuous-time implementation of Grover's algorithm is scalably robust to this error in the absence of error correction.
{
"annotation_id": "c4b5463e-10c0-4960-9578-97ebbd5bc2b5",
"date_created": "2026-03-02T18:01:59.601000Z",
"date_modified": "2026-03-02T18:01:59.601000Z",
"file_hash": "0e0a42e1cf13dbd555137fc8998480ae4006528788f2dc1a30151c36a5b4c827",
"private": false,
"record": {
"abstract": "Grover\u0027s algorithm provides a quadratic speed-up over classical algorithms\nfor unstructured database or library searches. This paper examines the\nrobustness of Grover\u0027s search algorithm to a random phase error in the oracle\nand analyzes the complexity of the search process as a function of the scaling\nof the oracle error with database or library size. Both the discrete- and\ncontinuous-time implementations of the search algorithm are investigated. It is\nshown that unless the oracle phase error scales as O(N^(-1/4)), neither the\ndiscrete- nor the continuous-time implementation of Grover\u0027s algorithm is\nscalably robust to this error in the absence of error correction.",
"arxiv_id": "quant-ph/0304138",
"authors": [
"Neil Shenvi",
"Kenneth R. Brown",
"K. Birgitta Whaley"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.68.052313",
"title": "Effects of Noisy Oracle on Search Algorithm Complexity",
"url": "https://arxiv.org/abs/quant-ph/0304138"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "57d25db4-3072-44e5-8814-f98b1ddbe439",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}