|
| related topics |
| {state, algorithm, problem} |
| {measurement, state, measurements} |
| {algorithm, log, probability} |
| {qubit, qubits, gate} |
| {time, wave, function} |
| {time, decoherence, evolution} |
| {operator, operators, space} |
| {phase, path, phys} |
| {cos, sin, state} |
| {states, state, optimal} |
| {temperature, thermal, energy} |
|
Quantum search by measurement
Andrew M. Childs, Enrico Deotto, Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Andrew J. Landahl
abstract: We propose a quantum algorithm for solving combinatorial search problems that
uses only a sequence of measurements. The algorithm is similar in spirit to
quantum computation by adiabatic evolution, in that the goal is to remain in
the ground state of a time-varying Hamiltonian. Indeed, we show that the
running times of the two algorithms are closely related. We also show how to
achieve the quadratic speedup for Grover's unstructured search problem with
only two measurements. Finally, we discuss some similarities and differences
between the adiabatic and measurement algorithms.
- oai_identifier:
- oai:arXiv.org:quant-ph/0204013
- categories:
- quant-ph
- comments:
- 8 pages, 2 figures
- doi:
- 10.1103/PhysRevA.66.032314
- arxiv_id:
- quant-ph/0204013
- journal_ref:
- Phys. Rev. A 66, 032314 (2002)
- report_no:
- MIT-CTP #3260
- created:
- 2002-04-03
Full article ▸
|
|
| related documents |
| 0308060v1 |
| 0611140v3 |
| 0702007v2 |
| 0411194v2 |
| 0105071v2 |
| 0605244v3 |
| 9701019v2 |
| 0312083v1 |
| 0609125v1 |
| 0303070v1 |
| 0204044v5 |
| 0506270v2 |
| 0502014v2 |
| 0506244v2 |
| 0405157v2 |
| 0308016v1 |
| 0602135v1 |
| 0406092v1 |
| 0209092v5 |
| 0507036v3 |
| 0410145v2 |
| 0211003v1 |
| 0405063v2 |
| 0408134v1 |
| 0606077v1 |
|