Portal de Periódicos da CAPES

Quantum search by measurement

2002; American Physical Society; Volume: 66; Issue: 3 Linguagem: Inglês

10.1103/physreva.66.032314

1538-4446

Andrew M. Childs, E. Deotto, Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Andrew J. Landahl,

Computability, Logic, AI Algorithms

We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar 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.