Follow
Sam Gutmann
Sam Gutmann
professor emeritus, mathematics, Northeastern University
Verified email at neu.edu
Title
Cited by
Cited by
Year
A quantum approximate optimization algorithm
E Farhi, J Goldstone, S Gutmann
arXiv preprint arXiv:1411.4028, 2014
27992014
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
23872001
Quantum computation by adiabatic evolution
E Farhi, J Goldstone, S Gutmann, M Sipser
arXiv preprint quant-ph/0001106, 2000
17252000
Quantum computation and decision trees
E Farhi, S Gutmann
Physical Review A 58 (2), 915, 1998
13731998
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
9832003
An example of the difference between quantum and classical random walks
AM Childs, E Farhi, S Gutmann
Quantum Information Processing 1, 35-43, 2002
5462002
Analog analogue of a digital quantum computation
E Farhi, S Gutmann
Physical Review A 57 (4), 2403, 1998
4551998
A quantum algorithm for the Hamiltonian NAND tree
E Farhi, J Goldstone, S Gutmann
arXiv preprint quant-ph/0702144, 2007
3392007
Agreement is feature sharing
J Frampton, S Gutmann
Ms., Northeastern University, 2000
3212000
A quantum approximate optimization algorithm (2014)
E Farhi, J Goldstone, S Gutmann
arXiv preprint arXiv:1411.4028, 2014
2822014
Crash‐proof syntax
J Frampton, S Gutmann
Derivation and explanation in the Minimalist Program, 90-105, 2002
2072002
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
2002022
Cyclic computation, a computationally efficient minimalist syntax
J Frampton, S Gutmann
Syntax 2 (1), 1-27, 1999
1691999
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
1691998
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
1642018
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
1402003
Quantum algorithms for fixed qubit architectures
E Farhi, J Goldstone, S Gutmann, H Neven
arXiv preprint arXiv:1703.06199, 2017
1352017
How probability arises in quantum mechanics
E Farhi, J Goldstone, S Gutmann
Annals of physics 192 (2), 368-382, 1989
1321989
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
1282020
How sentences grow in the mind
J Frampton, S Gutmann
Agreement systems, 121-157, 2006
1242006
The system can't perform the operation now. Try again later.
Articles 1–20