Sam Gutmann

According to our database, Sam Gutmann authored at least 10 papers between 1991 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size.

Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Leo Zhou

Quantum, 2022

2020

The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case.

Edward Farhi, David Gamarnik, Sam Gutmann

CoRR, 2020

2011

Unstructured randomness, small gaps and localization.

Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Peter W. Shor

Quantum Inf. Comput., 2011

Quantum adiabatic algorithms, small gaps, and different paths.

Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, Peter W. Shor

Quantum Inf. Comput., 2011

2008

A Quantum Algorithm for the Hamiltonian NAND Tree.

Edward Farhi, Jeffrey Goldstone, Sam Gutmann

Theory Comput., 2008

2003

Exponential algorithmic speedup by a quantum walk.

Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

An Example of the Difference Between Quantum and Classical Random Walks.

Andrew M. Childs, Edward Farhi, Sam Gutmann

Quantum Inf. Process., 2002

Finding cliques by quantum adiabatic evolution.

Andrew M. Childs, Edward Farhi, Jeffrey Goldstone, Sam Gutmann

Quantum Inf. Comput., 2002

2000

A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability

Edward Farhi, Jeffrey Goldstone, Sam Gutmann

CoRR, 2000

1991

The path integral for dendritic trees.

L. F. Abbott, Edward Farhi, Sam Gutmann

Biol. Cybern., 1991