|
| related topics |
| {state, algorithm, problem} |
| {algorithm, log, probability} |
| {measurement, state, measurements} |
| {phase, path, phys} |
| {cos, sin, state} |
| {vol, operators, histories} |
|
Quantum Portfolios
Sebastian Maurer, Tad Hogg, Bernardo Huberman
abstract: Quantum computation holds promise for the solution of many intractable
problems. However, since many quantum algorithms are stochastic in nature they
can only find the solution of hard problems probabilistically. Thus the
efficiency of the algorithms has to be characterized both by the expected time
to completion {\it and} the associated variance. In order to minimize both the
running time and its uncertainty, we show that portfolios of quantum algorithms
analogous to those of finance can outperform single algorithms when applied to
the NP-complete problems such as 3-SAT.
- oai_identifier:
- oai:arXiv.org:quant-ph/0105071
- categories:
- quant-ph
- comments:
- revision includes additional data and corrects minor typos
- doi:
- 10.1103/PhysRevLett.87.257901
- arxiv_id:
- quant-ph/0105071
- journal_ref:
- Physical Review Letters 87, 257901 (2001)
- created:
- 2001-05-15
- updated:
- 2001-06-22
Full article ▸
|
|
| related documents |
| 0411194v2 |
| 0702007v2 |
| 0609125v1 |
| 0303070v1 |
| 0204044v5 |
| 0611140v3 |
| 0308060v1 |
| 0502014v2 |
| 0506244v2 |
| 0108110v2 |
| 0111062v2 |
| 0312083v1 |
| 0109123v2 |
| 0106152v1 |
| 0109024v2 |
| 0405157v2 |
| 0308016v1 |
| 0602135v1 |
| 0209092v5 |
| 0410145v2 |
| 0204013v1 |
| 0405063v2 |
| 0106085v2 |
| 0211003v1 |
| 0507036v3 |
|