dorsal/arxiv
View SchemaDriving Hamiltonian in a Quantum Search Problem
| Authors | Kazuto Oshima |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0111021 |
| URL | https://arxiv.org/abs/quant-ph/0111021 |
Abstract
We examine the driving Hamiltonian in the analog analogue of Grover's algorithm by Farhi and Gutmann. For a quantum system with a given Hamiltonian $E|w> < w|$, we explicitly show that while the driving Hamiltonian $E|s> < s|$ optimally produces the state $|w>$ from an initial state $|s>$, the driving Hamiltonian $E^{\prime}|s> < s|(E^{\prime} \ne E)$ does not provide any speedup compared even with a classical computation.
{
"annotation_id": "e772cb6f-f13e-464c-a431-6ab2a9e52aa0",
"date_created": "2026-03-02T18:01:46.121000Z",
"date_modified": "2026-03-02T18:01:46.121000Z",
"file_hash": "9b59b3f7383ad493c998ccd90cc2ef09aa25a47b09b4fa3b070353e4e2b25c9c",
"private": false,
"record": {
"abstract": "We examine the driving Hamiltonian in the analog analogue of Grover\u0027s\nalgorithm by Farhi and Gutmann. For a quantum system with a given Hamiltonian\n$E|w\u003e \u003c w|$, we explicitly show that while the driving Hamiltonian $E|s\u003e \u003c s|$\noptimally produces the state $|w\u003e$ from an initial state $|s\u003e$, the driving\nHamiltonian $E^{\\prime}|s\u003e \u003c s|(E^{\\prime} \\ne E)$ does not provide any speedup\ncompared even with a classical computation.",
"arxiv_id": "quant-ph/0111021",
"authors": [
"Kazuto Oshima"
],
"categories": [
"quant-ph"
],
"title": "Driving Hamiltonian in a Quantum Search Problem",
"url": "https://arxiv.org/abs/quant-ph/0111021"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "636a7620-d8bf-4597-a7b1-7a4bfccd2122",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}