|
| related topics |
| {algorithm, log, probability} |
| {state, algorithm, problem} |
| {qubit, qubits, gate} |
| {measurement, state, measurements} |
| {state, phys, rev} |
| {operator, operators, space} |
|
A Novel Approach to Quantum Heuristics for Structured Database Search
Brian Murphy
abstract: An algorithm for structured database searching is presented and used to solve
the set partition problem. O(n) oracle calls are required in order to obtain a
solution, but the probability that this solution is optimal decreases
exponentially with problem size. Each oracle call is followed by a measurement,
implying that it is necessary to maintain quantum coherence for only one oracle
call at a time.
- oai_identifier:
- oai:arXiv.org:quant-ph/0106152
- categories:
- quant-ph
- comments:
- 17 pages, 4 figures
- arxiv_id:
- quant-ph/0106152
- created:
- 2001-06-27
Full article ▸
|
|
| related documents |
| 0010021v1 |
| 0011052v2 |
| 0306042v1 |
| 9706003v4 |
| 0210141v2 |
| 0609220v1 |
| 9905026v1 |
| 0702007v2 |
| 0505007v3 |
| 0109038v1 |
| 0609125v1 |
| 0204044v5 |
| 0302022v1 |
| 0201152v1 |
| 0511272v1 |
| 0303070v1 |
| 0609166v1 |
| 0105071v2 |
| 0506244v2 |
| 0108110v2 |
| 0502014v2 |
| 0303074v1 |
| 0609160v1 |
| 0111062v2 |
| 0308016v1 |
|