TY - JOUR
T1 - Quantum search by measurement
JF - Physical Review A
Y1 - 2002
A1 - Andrew M. Childs
A1 - Enrico Deotto
A1 - Edward Farhi
A1 - Jeffrey Goldstone
A1 - Sam Gutmann
A1 - Andrew J. Landahl
AB - 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.
VL - 66
UR - http://arxiv.org/abs/quant-ph/0204013v1
CP - 3
J1 - Phys. Rev. A
U5 - 10.1103/PhysRevA.66.032314
ER -