Gutmann, Sam

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science

Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Cited by 2,056

A Quantum Approximate Optimization Algorithm

Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv

Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Cited by 1,789

Quantum computation and decision trees

Farhi, E., & Gutmann, S. (1998) · Physical Review A

Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Cited by 1,215

Exponential algorithmic speedup by a quantum walk

Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Cited by 825

Quantum Computation by Adiabatic Evolution

Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv

Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Cited by 536

An Example of the Difference Between Quantum and Classical Random Walks

Childs, A. M., Farhi, E., & Gutmann, S. (2002) · Quantum Information Processing

Quantum Computing Algorithms and ArchitectureQuantum Mechanics and Applications

Cited by 481

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

Farhi, E., Goldstone, J., Gutmann, S., & Zhou, L. (2019) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 226

A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem

Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv

Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Cited by 131

Quantum Algorithms for Fixed Qubit Architectures

Farhi, E., Goldstone, J., Gutmann, S., & Neven, H. (2017) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 93

For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances

Brandao, F. G. S. L., Broughton, M., Farhi, E., Gutmann, S., & Neven, H. (2018) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 88

HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL

FARHI, E., GOLDSTONE, J., GUTMANN, S., & NAGAJ, D. (2008) · International Journal of Quantum Information

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 81