| 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 | 2170 | 2001 |
| A quantum approximate optimization algorithm E Farhi, J Goldstone, S Gutmann arXiv preprint arXiv:1411.4028, 2014 | 1937 | 2014 |
| Quantum computation by adiabatic evolution E Farhi, J Goldstone, S Gutmann, M Sipser arXiv preprint quant-ph/0001106, 2000 | 1442 | 2000 |
| Quantum computation and decision trees E Farhi, S Gutmann Physical Review A 58 (2), 915, 1998 | 1282 | 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 | 880 | 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 | 525 | 2002 |
| Analog analogue of a digital quantum computation E Farhi, S Gutmann Physical Review A 57 (4), 2403, 1998 | 439 | 1998 |
| A quantum algorithm for the Hamiltonian NAND tree E Farhi, J Goldstone, S Gutmann arXiv preprint quant-ph/0702144, 2007 | 328 | 2007 |
| Agreement is feature sharing J Frampton, S Gutmann Ms., Northeastern University, 2000 | 310 | 2000 |
| Crash‐proof syntax J Frampton, S Gutmann Derivation and explanation in the Minimalist Program, 90-105, 2002 | 202 | 2002 |
| A quantum approximate optimization algorithm (2014) E Farhi, J Goldstone, S Gutmann arXiv preprint arXiv:1411.4028, 2014 | 182 | 2014 |
| Cyclic computation, a computationally efficient minimalist syntax J Frampton, S Gutmann Syntax 2 (1), 1-27, 1999 | 162 | 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 | 161 | 1998 |
| How probability arises in quantum mechanics E Farhi, J Goldstone, S Gutmann Annals of physics 192 (2), 368-382, 1989 | 128 | 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 | 125 | 2003 |
| 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 | 121 | 2018 |
| How sentences grow in the mind J Frampton, S Gutmann Agreement systems, 121-157, 2006 | 120 | 2006 |
| Quantum algorithms for fixed qubit architectures E Farhi, J Goldstone, S Gutmann, H Neven arXiv preprint arXiv:1703.06199, 2017 | 117 | 2017 |
| Quantum adiabatic evolution algorithms versus simulated annealing E Farhi, J Goldstone, S Gutmann arXiv preprint quant-ph/0201031, 2002 | 117 | 2002 |
| Quantum adiabatic evolution algorithms with different paths E Farhi, J Goldstone, S Gutmann arXiv preprint quant-ph/0208135, 2002 | 115 | 2002 |
