836 citations · 905 across the 2 of their papers we have counts for
11 papers
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…
Quantum Adiabatic Evolution Algorithms with Different Paths
Edward Farhi, Jeffrey Goldstone, Sam Gutmann
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to con…
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…
Quantum Adiabatic Evolution Algorithms versus Simulated Annealing
Edward Farhi, Jeffrey Goldstone, Sam Gutmann
We explain why quantum adiabatic evolution and simulated annealing perform similarly in certain examples of searching for the minimum of a cost function of n bits. In these example…
An example of the difference between quantum and classical random walks
Andrew M. Childs, Edward Farhi, Sam Gutmann
In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical ra…
A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability
Edward Farhi, Jeffrey Goldstone, Sam Gutmann
Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that…