dorsal/arxiv
View SchemaGeneralization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time
| Authors | Goong Chen, Stephen A. Fulling, Jeesen Chen |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0007123 |
| URL | https://arxiv.org/abs/quant-ph/0007123 |
Abstract
L. K. Grover's search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover's algorithm in a Hilbert-space framework for both continuous and discrete time cases that isolates its geometrical essence to the case where more than one object satisfies the search criterion.
{
"annotation_id": "19b17d8e-e780-41a2-b06c-955601a96f1f",
"date_created": "2026-03-02T18:01:38.977000Z",
"date_modified": "2026-03-02T18:01:38.977000Z",
"file_hash": "65cb68820a128748a3eb5a9595c49bc91eb262bb875b6a27add63e515fb73696",
"private": false,
"record": {
"abstract": "L. K. Grover\u0027s search algorithm in quantum computing gives an optimal,\nquadratic speedup in the search for a single object in a large unsorted\ndatabase. In this paper, we generalize Grover\u0027s algorithm in a Hilbert-space\nframework for both continuous and discrete time cases that isolates its\ngeometrical essence to the case where more than one object satisfies the search\ncriterion.",
"arxiv_id": "quant-ph/0007123",
"authors": [
"Goong Chen",
"Stephen A. Fulling",
"Jeesen Chen"
],
"categories": [
"quant-ph"
],
"title": "Generalization of Grover\u0027s Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time",
"url": "https://arxiv.org/abs/quant-ph/0007123"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "87ede044-e575-4ff8-ab1d-36d9d0f34d7b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}