Edward Farhi

According to our database, Edward Farhi authored at least 16 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

The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model.

Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, Leo Zhou

Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

2020

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

Edward Farhi, David Gamarnik, Sam Gutmann

CoRR, 2020

2016

A quantum version of Schoning's algorithm applied to quantum 2-SAT.

Edward Farhi, Shelby Kimmel, Kristan Temme

Quantum Inf. Comput., 2016

2012

Quantum money.

Scott Aaronson, Edward Farhi, David Gosset, Avinatan Hassidim, Jonathan A. Kelner, Andrew Lutomirski

Commun. ACM, 2012

Quantum money from knots.

Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

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

A Quantum Monte Carlo method at fixed energy.

Edward Farhi, Jeffrey Goldstone, David Gosset, Harvey B. Meyer

Comput. Phys. Commun., 2011

2010

Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol.

Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor

Proceedings of the Innovations in Computer Science, 2010

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