dorsal/arxiv
View SchemaGrover's Algorithm for Multiobject Search in Quantum Computing
| Authors | G. Chen, S. A. Fulling, M. O. Scully |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9909040 |
| URL | https://arxiv.org/abs/quant-ph/9909040 |
Abstract
L. K. Grover's search algorithm in quantum computing gives an optimal, square-root speedup in the search for a single object in a large unsorted database. In this paper, we expound Grover's algorithm in a Hilbert-space framework that isolates its geometrical essence, and we generalize it to the case where more than one object satisfies the search criterion.
{
"annotation_id": "f4fbadb2-7e25-4519-86c6-d6b45d8f9359",
"date_created": "2026-03-02T18:02:48.463000Z",
"date_modified": "2026-03-02T18:02:48.463000Z",
"file_hash": "86239c684217b98359aa1f86978b511d5d2d05d5a55c4edc6df28e9c7d1d7672",
"private": false,
"record": {
"abstract": "L. K. Grover\u0027s search algorithm in quantum computing gives an optimal,\nsquare-root speedup in the search for a single object in a large unsorted\ndatabase. In this paper, we expound Grover\u0027s algorithm in a Hilbert-space\nframework that isolates its geometrical essence, and we generalize it to the\ncase where more than one object satisfies the search criterion.",
"arxiv_id": "quant-ph/9909040",
"authors": [
"G. Chen",
"S. A. Fulling",
"M. O. Scully"
],
"categories": [
"quant-ph"
],
"title": "Grover\u0027s Algorithm for Multiobject Search in Quantum Computing",
"url": "https://arxiv.org/abs/quant-ph/9909040"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "c076897e-cff1-4e79-b101-469c7222ba7b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}