836 citations · 905 across the 2 of their papers we have counts for
Showing 2001Show all
2 papers · 1 filter
quant-ph2001
Robustness of adiabatic quantum computation
Andrew M. Childs, Edward Farhi, John Preskill
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustnes…
quant-ph2001
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…