default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward Farhi
Person information
- affiliation: Department of Physics, MIT
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j10]Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Leo Zhou:
The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size. Quantum 6: 759 (2022)- 2016
- [j9]Edward Farhi, Shelby Kimmel, Kristan Temme:
A quantum version of Schoning's algorithm applied to quantum 2-SAT. Quantum Inf. Comput. 16(13&14): 1212-1227 (2016) - 2012
- [j8]Scott Aaronson, Edward Farhi, David Gosset, Avinatan Hassidim, Jonathan A. Kelner, Andrew Lutomirski:
Quantum money. Commun. ACM 55(8): 84-92 (2012) - 2011
- [j7]Edward Farhi, Jeffrey Goldstone, David Gosset, Harvey B. Meyer:
A Quantum Monte Carlo method at fixed energy. Comput. Phys. Commun. 182(8): 1663-1673 (2011) - [j6]Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, Peter W. Shor:
Quantum adiabatic algorithms, small gaps, and different paths. Quantum Inf. Comput. 11(3&4): 181-214 (2011) - [j5]Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Peter W. Shor:
Unstructured randomness, small gaps and localization. Quantum Inf. Comput. 11(9&10): 840-854 (2011) - 2008
- [j4]Edward Farhi, Jeffrey Goldstone, Sam Gutmann:
A Quantum Algorithm for the Hamiltonian NAND Tree. Theory Comput. 4(1): 169-190 (2008) - 2002
- [j3]Andrew M. Childs, Edward Farhi, Jeffrey Goldstone, Sam Gutmann:
Finding cliques by quantum adiabatic evolution. Quantum Inf. Comput. 2(3): 181-191 (2002) - [j2]Andrew M. Childs
, Edward Farhi, Sam Gutmann:
An Example of the Difference Between Quantum and Classical Random Walks. Quantum Inf. Process. 1(1-2): 35-43 (2002) - 1991
- [j1]L. F. Abbott, Edward Farhi, Sam Gutmann:
The path integral for dendritic trees. Biol. Cybern. 66(1): 49-60 (1991)
Conference and Workshop Papers
- 2022
- [c4]Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, Leo Zhou:
The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model. TQC 2022: 7:1-7:21 - 2012
- [c3]Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor:
Quantum money from knots. ITCS 2012: 276-289 - 2010
- [c2]Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor:
Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. ICS 2010: 20-31 - 2003
- [c1]Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman:
Exponential algorithmic speedup by a quantum walk. STOC 2003: 59-68
Informal and Other Publications
- 2021
- [i6]Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, Leo Zhou:
The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model. CoRR abs/2110.14206 (2021) - 2020
- [i5]Edward Farhi, David Gamarnik, Sam Gutmann:
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case. CoRR abs/2004.09002 (2020) - 2016
- [i4]Edward Farhi, Shelby Kimmel, Kristan Temme:
A Quantum Version of Schöning's Algorithm Applied to Quantum 2-SAT. CoRR abs/1603.06985 (2016) - 2010
- [i3]Edward Farhi, David Gosset, Avinatan Hassidim, Andrew Lutomirski, Peter W. Shor:
Quantum money from knots. CoRR abs/1004.5127 (2010) - 2009
- [i2]Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, Harvey B. Meyer, Peter W. Shor:
Quantum Adiabatic Algorithms, Small Gaps, and Different Paths. CoRR abs/0909.4766 (2009) - 2000
- [i1]Edward Farhi, Jeffrey Goldstone, Sam Gutmann:
A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability. CoRR quant-ph/0007071 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
