dorsal/arxiv
View SchemaSure success partial search
| Authors | Byung-Soo Choi, Thomas A. Walker, Samuel L. Braunstein |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0603136 |
| URL | https://arxiv.org/abs/quant-ph/0603136 |
| DOI | 10.1007/s11128-006-0037-y |
| Journal | Quantum Information Processing 6(1) pp.1-8 2007 |
Abstract
Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability.
{
"annotation_id": "5ba2ed7c-f833-41c7-968d-c602b84e479e",
"date_created": "2026-03-02T18:02:24.144000Z",
"date_modified": "2026-03-02T18:02:24.144000Z",
"file_hash": "fbea79f91f306f8ef1dcc3807c7e2ab62c493c25481419341c8215ab1cab5c8d",
"private": false,
"record": {
"abstract": "Partial search has been proposed recently for finding the target block\ncontaining a target element with fewer queries than the full Grover search\nalgorithm which can locate the target precisely. Since such partial searches\nwill likely be used as subroutines for larger algorithms their success rate is\nimportant. We propose a partial search algorithm which achieves success with\nunit probability.",
"arxiv_id": "quant-ph/0603136",
"authors": [
"Byung-Soo Choi",
"Thomas A. Walker",
"Samuel L. Braunstein"
],
"categories": [
"quant-ph"
],
"doi": "10.1007/s11128-006-0037-y",
"journal_ref": "Quantum Information Processing 6(1) pp.1-8 2007",
"title": "Sure success partial search",
"url": "https://arxiv.org/abs/quant-ph/0603136"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "61d79789-fb58-4f54-8b46-a130f7ee9fc0",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}