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

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 | 2345 | 2001 |

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

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

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 | 971 | 2003 |

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

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

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

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

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

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

The quantum approximate optimization algorithm and the sherrington-kirkpatrick model at infinite size E Farhi, J Goldstone, S Gutmann, L Zhou Quantum 6, 759, 2022 | 182 | 2022 |

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

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 | 168 | 1998 |

For fixed control parameters the quantum approximate optimization algorithm's objective function value concentrates for typical instances FGSL Brandao, M Broughton, E Farhi, S Gutmann, H Neven arXiv preprint arXiv:1812.04170, 2018 | 153 | 2018 |

Proceedings of the thirty-fifth Annual ACM Symposium on Theory of Computing AM Childs, R Cleve, E Deotto, E Farhi, S Gutmann, DA Spielman ACM, 2003 | 139 | 2003 |

Quantum algorithms for fixed qubit architectures E Farhi, J Goldstone, S Gutmann, H Neven arXiv preprint arXiv:1703.06199, 2017 | 134 | 2017 |

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

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

The quantum approximate optimization algorithm needs to see the whole graph: A typical case E Farhi, D Gamarnik, S Gutmann arXiv preprint arXiv:2004.09002, 2020 | 123 | 2020 |