1k citations · 3.1k across the 10 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
quant-ph2002★ 836 cited
Exponential algorithmic speedup by quantum walk
Andrew M. Childs, Richard Cleve, Enrico Deotto +3
We construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a c…
quant-ph2002
Quantum search by measurement
Andrew M. Childs, Enrico Deotto, Edward Farhi +3
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 adi…