Követés
Edward Farhi
Edward Farhi
Google/MIT
E-mail megerősítve itt: mit.edu
Cím
Hivatkozott rá
Hivatkozott rá
Év
Quantum supremacy using a programmable superconducting processor
F Arute, K Arya, R Babbush, D Bacon, JC Bardin, R Barends, R Biswas, ...
Nature 574 (7779), 505-510, 2019
92912019
A quantum approximate optimization algorithm
E Farhi, J Goldstone, S Gutmann
arXiv preprint arXiv:1411.4028, 2014
37972014
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
25182001
Strange matter
E Farhi, RL Jaffe
Physical Review D 30 (11), 2379, 1984
23071984
Quantum computation by adiabatic evolution
E Farhi, J Goldstone, S Gutmann, M Sipser
arXiv preprint quant-ph/0001106, 2000
19602000
Strange stars
C Alcock, E Farhi, A Olinto
Astrophysical Journal, Part 1 (ISSN 0004-637X), vol. 310, Nov. 1, 1986, p …, 1986
16661986
Quantum chromodynamics test for jets
E Farhi
Physical Review Letters 39 (25), 1587, 1977
15441977
Quantum computation and decision trees
E Farhi, S Gutmann
Physical Review A 58 (2), 915, 1998
14301998
Technicolour
E Farhi, L Susskind
Physics Reports 74 (3), 277-321, 1981
13471981
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
10402003
Classification with quantum neural networks on near term processors
E Farhi, H Neven
arXiv preprint arXiv:1802.06002, 2018
10002018
Particle production in the new inflationary cosmology
LF Abbott, E Farhi, MB Wise
Physics Letters B 117 (1-2), 29-33, 1982
8641982
Hartree-Fock on a superconducting qubit quantum computer
Google AI Quantum and Collaborators*†, F Arute, K Arya, R Babbush, ...
Science 369 (6507), 1084-1089, 2020
7442020
Suppressing quantum errors by scaling a surface code logical qubit
Nature 614 (7949), 676-681, 2023
6952023
Quantum supremacy through the quantum approximate optimization algorithm
E Farhi, AW Harrow
arXiv preprint arXiv:1602.07674, 2016
6072016
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
MP Harrigan, KJ Sung, M Neeley, KJ Satzinger, F Arute, K Arya, J Atalaya, ...
Nature Physics 17 (3), 332-336, 2021
6042021
Robustness of adiabatic quantum computation
AM Childs, E Farhi, J Preskill
Physical Review A 65 (1), 012322, 2001
5832001
An example of the difference between quantum and classical random walks
AM Childs, E Farhi, S Gutmann
Quantum Information Processing 1, 35-43, 2002
5602002
Are the weak interactions strong?
LF Abbott, E Farhi
Physics Letters B 101 (1-2), 69-72, 1981
4811981
Analog analogue of a digital quantum computation
E Farhi, S Gutmann
Physical Review A 57 (4), 2403, 1998
4691998
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20