dorsal/arxiv
View SchemaSearching in Grover's Algorithm
| Authors | Richard Jozsa |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9901021 |
| URL | https://arxiv.org/abs/quant-ph/9901021 |
Abstract
Grover's algorithm is usually described in terms of the iteration of a compound operator of the form $Q = - H I_{0} H I_{x_0}$. Although it is quite straightforward to verify the algebra of the iteration, this gives little insight into why the algorithm works. What is the significance of the compound structure of $Q$? Why is there a minus sign? Later it was discovered that $H$ could be replaced by essentially any unitary $U$. What is the freedom involved here? We give a description of Grover's algorithm which provides some clarification of these questions.
{
"annotation_id": "bfbf8350-0d56-46f9-942c-a523cd48186d",
"date_created": "2026-03-02T18:02:44.484000Z",
"date_modified": "2026-03-02T18:02:44.484000Z",
"file_hash": "4a287a826a2aece605e61ab56a1980a1c372788c20309ca416b7f79ece6b2321",
"private": false,
"record": {
"abstract": "Grover\u0027s algorithm is usually described in terms of the iteration of a\ncompound operator of the form $Q = - H I_{0} H I_{x_0}$. Although it is quite\nstraightforward to verify the algebra of the iteration, this gives little\ninsight into why the algorithm works. What is the significance of the compound\nstructure of $Q$? Why is there a minus sign? Later it was discovered that $H$\ncould be replaced by essentially any unitary $U$. What is the freedom involved\nhere? We give a description of Grover\u0027s algorithm which provides some\nclarification of these questions.",
"arxiv_id": "quant-ph/9901021",
"authors": [
"Richard Jozsa"
],
"categories": [
"quant-ph"
],
"title": "Searching in Grover\u0027s Algorithm",
"url": "https://arxiv.org/abs/quant-ph/9901021"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "54ec7719-632b-4cd5-a349-bc83aab3a729",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}