dorsal/arxiv
View SchemaA Quantum Algorithm for Finding the Minimum
| Authors | Christoph Durr, Peter Hoyer |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9607014 |
| URL | https://arxiv.org/abs/quant-ph/9607014 |
Abstract
We give a quantum algorithm to find the index y in a table T of size N such that in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c.
{
"annotation_id": "bba1a56a-1c11-4203-87f8-fcbdf32a5151",
"date_created": "2026-03-02T18:02:37.781000Z",
"date_modified": "2026-03-02T18:02:37.781000Z",
"file_hash": "5de884e94de16b6c20ef71a1fae3ff42b07c4a06381957f99436965cb79685d3",
"private": false,
"record": {
"abstract": "We give a quantum algorithm to find the index y in a table T of size N such\nthat in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c.",
"arxiv_id": "quant-ph/9607014",
"authors": [
"Christoph Durr",
"Peter Hoyer"
],
"categories": [
"quant-ph",
"cs.DS"
],
"title": "A Quantum Algorithm for Finding the Minimum",
"url": "https://arxiv.org/abs/quant-ph/9607014"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f80c1c5b-68c9-44e5-bbd0-bf0f174283f6",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}