7.2k citations · 23.3k across the 83 of their papers we have counts for
3 papers · 2 filters
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…
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Edward Farhi, Jeffrey Goldstone, Sam Gutmann +3
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a…
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…