Edward Farhi

Edward Farhi
Born
Edward Henry Farhi

(1952-06-26) June 26, 1952[1]
New York, U.S.[1]
EducationBronx Science
Brandeis University
Harvard University
Scientific career
FieldsPhysics
WorkplacesSLAC
CERN
MIT
Howard Georgi

Edward Henry Farhi (born June 26, 1952[1]) is an American physicist who is currently a principal scientist at Google. Until 2018, he was the Cecil and Ida Green Professor of Physics at MIT, and from 2004 to 2016 he was the director of the MIT Center for Theoretical Physics. He worked on particle physics and general relativity before moving to quantum computing.

Biography

Farhi attended the Bronx High School of Science and obtained a B.A. and M.A. in physics at Brandeis University before receiving a Ph.D. in 1978 from Harvard University advised by Howard Georgi. He was on the staff at the Stanford Linear Accelerator Center and at CERN in Geneva, Switzerland before joining MIT in 1982. From July 2004 to 2016, he was the Director of the MIT Center for Theoretical Physics.[2]

Work

As a graduate student, Farhi introduced the jet variable thrust.[3] He later worked with Leonard Susskind on grand unified theories with electro-weak dynamical symmetry breaking and with Larry Abbott at CERN on models in which quarks, leptons, and massive gauge bosons are composite.[4] He and Robert Jaffe formalized a notion of strange matter[5] and with Charles Alcock and Angela Olinto he studied "strange stars,"[6] compact objects made of strange matter. Later, he and Alan Guth studied limitations on creating a new inflationary universe in a laboratory.[7] He and Guth, along with Sean Carroll, gave limitations on the existence of Gott time machines in two spatial dimensions.[8]

Since the late '90s, Farhi has worked on quantum computing and quantum algorithms. He and Sam Gutmann, who have known each other since high school,[9] introduced a continuous-time Hamiltonian-based approach to quantum computation.[10] and proposed the first algorithms based on quantum walks.[11] Along with Jeffrey Goldstone and Michael Sipser, they introduced an early proposal for adiabatic quantum computation.[12] In 2007, Farhi, Goldstone, and Gutmann gave a polynomial quantum speedup, using quantum walks, for solving a certain combinatorial game.[13] In 2010, along with Peter Shor and three others at MIT, he introduced a scheme for quantum money.[14] In 2014 Farhi, Goldstone, and Gutmann introduced the quantum approximate optimization algorithm (QAOA) for finding approximate solutions to combinatorial search problems,[15] which as of 2024 was viewed as a leading candidate to run on contemporary noisy intermediate-scale quantum devices.[16][17] Farhi and Aram Harrow have argued that the lowest depth version of the QAOA could exhibit a form of quantum supremacy.[18]

References

  1. 1 2 3 American Men and Women of Science, Thomson Gale 2004
  2. ↑ "Edward Farhi » MIT Physics". MIT Physics. 2025-08-01.
  3. ↑ Farhi, Edward (1977). "Quantum Chromodynamics Test for Jets". Physical Review Letters. 39 (25): 1587–1588. Bibcode:1977PhRvL..39.1587F. doi:10.1103/PhysRevLett.39.1587.
  4. ↑ Abbott, L.F.; Farhi, Edward (1982). "Are the weak interactions strong". Physics Letters B. 117 (1–2): 29–33. doi:10.1016/0370-2693(82)90867-X.
  5. ↑ Farhi, Edward; Jaffe, R. L. (1984). "Strange matter". Physical Review D. 30 (11): 2379–2390. Bibcode:1984PhRvD..30.2379F. doi:10.1103/PhysRevD.30.2379.
  6. ↑ Alcock, Charles; Farhi, Edward; Olinto, Angela (1986). "Strange stars". The Astrophysical Journal. 310: 261. Bibcode:1986ApJ...310..261A. doi:10.1086/164679.
  7. ↑ Farhi, Edward; Guth, Alan H. (1987). "An obstacle to creating a universe in the laboratory". Physics Letters B. 183 (2): 149. Bibcode:1987PhLB..183..149F. doi:10.1016/0370-2693(87)90429-1.
  8. ↑ Carroll, Sean M.; Farhi, Edward; Guth, Alan H. (1992). "Gott Time Machines Cannot Exist in an Open (2+1)-Dimensional Universe with Timelike Total Momentum". arXiv:hep-th/9207037.
  9. ↑ "About the Authors: Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science". Theory of Computing.
  10. ↑ Farhi, Edward; Gutmann, Sam (1996). "An Analog Analogue of a Digital Quantum Computation". arXiv:quant-ph/9612026.
  11. ↑ Farhi, Edward; Gutmann, Sam (1998). "Quantum computation and decision trees". Physical Review A. 58 (2): 915–928. arXiv:quant-ph/9706062. Bibcode:1998PhRvA..58..915F. doi:10.1103/PhysRevA.58.915. S2CID 1439479.
  12. ↑ Farhi, Edward; Goldstone, Jeffrey; Gutmann, Sam; Sipser, Michael (1999). "Quantum Computation by Adiabatic Evolution". arXiv:quant-ph/0001106.
  13. ↑ Farhi, Edward; Goldstone, Jeffrey; Gutmann, Sam (2007). "A Quantum Algorithm for the Hamiltonian NAND Tree". arXiv:quant-ph/0702144.
  14. ↑ Farhi, Edward; Gosset, David; Hassidim, Avinatan; Lutomirski, Andrew; Shor, Peter (2010). "Quantum money from knots". arXiv:1004.5127 [quant-ph].
  15. ↑ Farhi, Edward; Goldstone, Jeffrey; Gutmann, Sam (2014). "A Quantum Approximate Optimization Algorithm". arXiv:1411.4028 [quant-ph].
  16. ↑ Blekos, Kostas; Brand, Dean; Ceschini, Andrea; Chou, Chiao-Hui; Li, Rui-Hao; Pandya, Komal; Summer, Alessandro (2024-06-02). "A review on Quantum Approximate Optimization Algorithm and its variants". Physics Reports. 1068: 1–66. arXiv:2306.09198. Bibcode:2024PhR..1068....1B. doi:10.1016/j.physrep.2024.03.002. ISSN 0370-1573.
  17. ↑ Dargan, James (2023-03-13). "What Is NISQ Quantum Computing?". The Quantum Insider. Retrieved 2025-01-07.
  18. ↑ Farhi, Edward; Aram W Harrow (2016). "Quantum Supremacy through the Quantum Approximate Optimization Algorithm". arXiv:1602.07674 [quant-ph].
This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.