A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem E Farhi, J Goldstone, S Gutmann, J Lapan, A Lundgren, D Preda Science 292 (5516), 472-475, 2001 | 1725 | 2001 |

Quantum computation and decision trees E Farhi, S Gutmann Physical Review A 58 (2), 915, 1998 | 1023 | 1998 |

Quantum computation by adiabatic evolution E Farhi, J Goldstone, S Gutmann, M Sipser arXiv preprint quant-ph/0001106, 2000 | 910 | 2000 |

Exponential algorithmic speedup by a quantum walk AM Childs, R Cleve, E Deotto, E Farhi, S Gutmann, DA Spielman Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 652 | 2003 |

A quantum approximate optimization algorithm E Farhi, J Goldstone, S Gutmann arXiv preprint arXiv:1411.4028, 2014 | 488 | 2014 |

An example of the difference between quantum and classical random walks AM Childs, E Farhi, S Gutmann Quantum Information Processing 1 (1-2), 35-43, 2002 | 442 | 2002 |

Analog analogue of a digital quantum computation E Farhi, S Gutmann Physical Review A 57 (4), 2403, 1998 | 371 | 1998 |

A quantum algorithm for the Hamiltonian NAND tree E Farhi, J Goldstone, S Gutmann arXiv preprint quant-ph/0702144, 2007 | 284 | 2007 |

Agreement is feature sharing J Frampton, S Gutmann Ms., Northeastern University, 2000 | 272 | 2000 |

Crash-proof syntax J Frampton, S Gutmann Derivation and explanation in the Minimalist Program, 90-105, 2002 | 183 | 2002 |

Limit on the speed of quantum computation in determining parity E Farhi, J Goldstone, S Gutmann, M Sipser Physical Review Letters 81 (24), 5442, 1998 | 151 | 1998 |

Cyclic computation, a computationally efficient minimalist syntax J Frampton, S Gutmann Syntax 2 (1), 1-27, 1999 | 149 | 1999 |

How probability arises in quantum mechanics E Farhi, J Goldstone, S Gutmann Annals of physics 192 (2), 368-382, 1989 | 116 | 1989 |

Proceedings of the 35th ACM Symposium on Theory of Computing AM Childs, R Cleve, E Deotto, E Farhi, S Gutmann, DA Spielman ACM Press, 2003 | 112 | 2003 |

Quantum adiabatic evolution algorithms with different paths E Farhi, J Goldstone, S Gutmann arXiv preprint quant-ph/0208135, 2002 | 99 | 2002 |

How sentences grow in the mind J Frampton, S Gutmann Agreement systems, 121-157, 2006 | 97 | 2006 |

The path integral for dendritic trees LF Abbott, E Farhi, S Gutmann Biological cybernetics 66 (1), 49-60, 1991 | 93 | 1991 |

Functional integral for a free particle in a box M Carreau, E Farhi, S Gutmann Physical Review D 42 (4), 1194, 1990 | 90 | 1990 |

Quantum adiabatic evolution algorithms versus simulated annealing E Farhi, J Goldstone, S Gutmann arXiv preprint quant-ph/0201031, 2002 | 84 | 2002 |

How to make the quantum adiabatic algorithm fail E Farhi, J Goldstone, S Gutmann, D Nagaj International Journal of Quantum Information 6 (03), 503-516, 2008 | 81 | 2008 |