dorsal/arxiv
View SchemaStructured Adiabatic Quantum Search
| Authors | Daria Ahrensmeier, Saurya Das, Randy Kobes, Gabor Kunstatter, Haitham Zaraket |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0208065 |
| URL | https://arxiv.org/abs/quant-ph/0208065 |
Abstract
We examine the use of adiabatic quantum algorithms to solve structured, or nested, search problems. We construct suitable time dependent Hamiltonians and derive the computation times for a general class of nested searches involving n qubits. As expected, we find that as additional structure is included, the Hamiltonians become more local and the computation times decrease.
{
"annotation_id": "14fd0e17-2082-4b65-af6a-22bc491aab96",
"date_created": "2026-03-02T18:01:52.862000Z",
"date_modified": "2026-03-02T18:01:52.862000Z",
"file_hash": "c00702b223fed9e8e2ffaced19080ddf3c71629406bb23628451a0de11efe217",
"private": false,
"record": {
"abstract": "We examine the use of adiabatic quantum algorithms to solve structured, or\nnested, search problems. We construct suitable time dependent Hamiltonians and\nderive the computation times for a general class of nested searches involving n\nqubits. As expected, we find that as additional structure is included, the\nHamiltonians become more local and the computation times decrease.",
"arxiv_id": "quant-ph/0208065",
"authors": [
"Daria Ahrensmeier",
"Saurya Das",
"Randy Kobes",
"Gabor Kunstatter",
"Haitham Zaraket"
],
"categories": [
"quant-ph",
"hep-th"
],
"title": "Structured Adiabatic Quantum Search",
"url": "https://arxiv.org/abs/quant-ph/0208065"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a26a14fd-0889-4e39-9904-75b61c04b95f",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}