dorsal/arxiv
View SchemaA Modification of Grover's Algorithm as a Fast Database Search
| Authors | D. A. Ross |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9807078 |
| URL | https://arxiv.org/abs/quant-ph/9807078 |
Abstract
A modification of Grover's algorithm is proposed, which can be used directly as a fast database search. An explicit two q-bit example is displayed in detail. We discuss the case where the database has multiple entries corresponding to the same target value.
{
"annotation_id": "ec3bd588-6a77-4235-87b9-bd0599f8e185",
"date_created": "2026-03-02T18:02:44.595000Z",
"date_modified": "2026-03-02T18:02:44.595000Z",
"file_hash": "74552ec955283a558d75fe75d9bb6c2d8df594fbd14ee656a66312b042262796",
"private": false,
"record": {
"abstract": "A modification of Grover\u0027s algorithm is proposed, which can be used directly\nas a fast database search. An explicit two q-bit example is displayed in\ndetail. We discuss the case where the database has multiple entries\ncorresponding to the same target value.",
"arxiv_id": "quant-ph/9807078",
"authors": [
"D. A. Ross"
],
"categories": [
"quant-ph"
],
"title": "A Modification of Grover\u0027s Algorithm as a Fast Database Search",
"url": "https://arxiv.org/abs/quant-ph/9807078"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a523af72-76f8-4944-aa92-4e57ff8edb68",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}