|
| related topics |
| {state, algorithm, problem} |
| {algorithm, log, probability} |
| {equation, function, exp} |
| {time, decoherence, evolution} |
| {time, wave, function} |
| {vol, operators, histories} |
| {bell, inequality, local} |
| {states, state, optimal} |
| {information, entropy, channel} |
| {energy, state, states} |
|
Energy and Efficiency of Adiabatic Quantum Search Algorithms
Saurya Das, Randy Kobes, Gabor Kunstatter
abstract: We present the results of a detailed analysis of a general, unstructured
adiabatic quantum search of a data base of $N$ items. In particular we examine
the effects on the computation time of adding energy to the system. We find
that by increasing the lowest eigenvalue of the time dependent Hamiltonian {\it
temporarily} to a maximum of $\propto \sqrt{N}$, it is possible to do the
calculation in constant time. This leads us to derive the general theorem which
provides the adiabatic analogue of the $\sqrt{N}$ bound of conventional quantum
searches. The result suggests that the action associated with the oracle term
in the time dependent Hamiltonian is a direct measure of the resources required
by the adiabatic quantum search.
- oai_identifier:
- oai:arXiv.org:quant-ph/0204044
- categories:
- quant-ph hep-th
- comments:
- 6 pages, Revtex, 1 figure. Theorem modified, references and comments
added, sections introduced, typos corrected. Version to appear in J. Phys. A
- doi:
- 10.1088/0305-4470/36/11/313
- arxiv_id:
- quant-ph/0204044
- journal_ref:
- J. Phys. A: Math. Gen. 36 (2003) 1-7
- created:
- 2002-04-08
- updated:
- 2003-02-25
Full article ▸
|
|
| related documents |
| 9702039v4 |
| 0609125v1 |
| 0303070v1 |
| 0506244v2 |
| 0108110v2 |
| 0009086v1 |
| 0502014v2 |
| 0308016v1 |
| 0602135v1 |
| 0105071v2 |
| 0209092v5 |
| 0410145v2 |
| 0405063v2 |
| 0408134v1 |
| 0211003v1 |
| 0310121v1 |
| 0605132v1 |
| 0608156v1 |
| 0206078v1 |
| 0209148v1 |
| 0406146v1 |
| 0209139v1 |
| 0502144v1 |
| 0612033v1 |
| 0606242v3 |
|