Biography:Peter Shor

From HandWiki
Short description: American mathematician
Peter Shor
Peter Shor 2017 Dirac Medal Award Ceremony.png
Peter Shor speaking
after receiving the 2017 Dirac Medal
Born (1959-08-14) August 14, 1959 (age 64)
New York City , New York, U.S.
NationalityAmerican
Alma mater
Known forShor's algorithm
Shor code
CSS code
SMAWK algorithm
Stabilizer code
Quantum threshold theorem
Awards
  • Putnam Fellow (1978)[1]
  • Nevanlinna Prize (1998)[2]
  • MacArthur Fellowship (July 1999)[3]
  • Gödel Prize (1999)[4]
  • King Faisal International Prize (2002)[5]
  • ICS Prize (2007)[6]
  • Dirac Medal (2017) of ICTP[7]
  • Micius Quantum Prize (2018)
  • IEEE Eric E. Sumner Award (2018)[8]
    BBVA Foundation Frontiers of Knowledge Award (2019)
  • Lise Meitner Distinguished Lecture and Medal, (2022)
  • Breakthrough Prize in Fundamental Physics (2023)[9]
Scientific career
FieldsComputer science, applied mathematics
Institutions
ThesisRandom planar matching and bin packing (1985)
Doctoral advisorTom Leighton
Doctoral studentsRamis Movassagh [10]

Peter Williston Shor (born August 14, 1959) is an American professor of applied mathematics at MIT. He is known for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.

Early life and education

Shor was born in New York City to Joan Bopp Shor and S. W. Williston Shor.[11][12] He grew up in Washington, D.C. and Mill Valley, California.[11] While attending Tamalpais High School, he placed third in the 1977 USA Mathematical Olympiad.[13] After graduation that year, he won a silver medal at the International Math Olympiad in Yugoslavia (the U.S. team achieved the most points per country that year).[14][15] He received his B.S. in Mathematics in 1981 for undergraduate work at Caltech,[16] and was a Putnam Fellow in 1978. He earned his PhD in Applied Mathematics from MIT in 1985.[17] His doctoral advisor was F. Thomson Leighton, and his thesis was on probabilistic analysis of bin-packing algorithms.

Career

After being awarded his PhD by MIT, he spent one year as a postdoctoral researcher at the University of California, Berkeley, and then accepted a position at Bell Labs in New Providence, New Jersey. It was there he developed Shor's algorithm. This development was inspired by Simon's problem, where he first solved the discrete log problem (which relates point-finding on a hypercube to a torus) and,

"Later that week, I was able to solve the factoring problem as well. There’s a strange relation between discrete log and factoring."[18]

Due to their similarity as HSP problems, Shor discovered a related factoring problem (Shor's algorithm) that same week for which he was awarded the Nevanlinna Prize at the 23rd International Congress of Mathematicians in 1998[19][20] and the Gödel Prize in 1999.[21] In 1999, he was awarded a MacArthur Fellowship.[22] In 2017, he received the Dirac Medal of the ICTP and for 2019 the BBVA Foundation Frontiers of Knowledge Award in Basic Sciences.[23]

Shor began his MIT position in 2003. Currently, he is the Henry Adams Morss and Henry Adams Morss, Jr. Professor of Applied Mathematics in the Department of Mathematics at MIT. He also is affiliated with CSAIL and the MIT Center for Theoretical Physics (CTP).[citation needed]

He received a Distinguished Alumni Award from Caltech in 2007.[16]

On October 1, 2011, he was inducted into the American Academy of Arts and Sciences.[24][25] He was elected as an ACM Fellow in 2019 "for contributions to quantum-computing, information theory, and randomized algorithms".[26] He was elected as a member of the National Academy of Sciences in 2002.[27] In 2020, he was elected a member of the National Academy of Engineering for pioneering contributions to quantum computation.[28]

In an interview published in Nature on October 30, 2020, Shor said that he considers post-quantum cryptography to be a solution to the quantum threat, although a lot of engineering effort is required to switch from vulnerable algorithms.[29]

Along with three others, Shor was awarded the 2023 Breakthrough Prize in Fundamental Physics for "foundational work in the field of quantum information."[9]

See also

Notes

  1. ↑ "The Mathematical Association of America's William Lowell Putnam Competition". Mathematical Association of America. https://www.maa.org/awards/putnam.html. 
  2. ↑ "Fields Medalists / Nevanlinna Price (sic) Winner 1998". International Mathematical Union. August 22, 2006. https://www.mathunion.org/o/General/Prizes/Nevanlinna/1998/. 
  3. ↑ "Fellows List – July 1999". John D. and Catherine T. MacArthur Foundation. https://www.macfound.org/site/c.lkLXJ8MQKrH/b.1142725/k.2948/Fellows_List__July_1999.htm. 
  4. ↑ Parberry, Ian (May 10, 1999). "1999 Gödel Prize". ACM SIGACT. https://sigact.acm.org/Prizes/godel/1999.html. 
  5. ↑ "2002 King Faisal International Prizes for Science Announced". King Faisal Foundation. https://www.kff.com/AR01/KFIP/1422H2002G/KFIPWinners5SCI1422H2002G.html. 
  6. ↑ "ICS Prize". https://www.informs.org/Community/ICS/Prizes/ICS-Prize. 
  7. ↑ Dirac Medal of ICTP 2017
  8. ↑ List of IEEE Eric E. Sumner Award Recipients
  9. ↑ 9.0 9.1 Chu, Jennifer (September 22, 2022). "Peter Shor wins Breakthrough Prize in Fundamental Physics". MIT News. https://news.mit.edu/2022/shor-spielman-breakthrough-prize-0922. 
  10. ↑ "The Mathematics Genealogy Project". https://genealogy.math.ndsu.nodak.edu/id.php?id=174407. 
  11. ↑ 11.0 11.1 [1],Joan Shor Obituary
  12. ↑ '[2], Shor Family History
  13. ↑ Murray Klamkin (Editor). Mathematical Association of America (January 1989). USA Mathematical Olympiads 1972–1986 Problems and Solutions (Anneli Lax New Mathematical Library), ISBN 0-88385-634-4 ISBN 978-0-88385-634-5, accessed May 10, 2007
  14. ↑ Mill Valley Historical Society, 2004, 'History of Homestead Valley'
  15. ↑ Stephen R. Dunbar, 'Identifying Talent: American Mathematics Competitions,' in Mathematical Association of America, Focus, Vol 24, Issue 3, March 2004, p 29
  16. ↑ 16.0 16.1 "2007 Recipients". Distinguished Alumni Award. Caltech Alumni Association. https://alumni.caltech.edu/distinguished_alumni/by_year?year=2007. 
  17. ↑ Shor, Peter Williston (September 1985). Random Planar Matching and Bin Packing (Ph.D. thesis). MIT. OCLC 14107348.
  18. ↑ Shor, Peter W. (2022-08-21). "The Early Days of Quantum Computation". arXiv:2208.09964 [quant-ph].
  19. ↑ Jackson, Allyn (November 1998). "Peter Shor Receives Nevanlinna Prize". Notices of the AMS: 1361. https://www.ams.org/notices/199810/comm-nevanlinna.pdf. 
  20. ↑ Shor, Peter (1998). "Quantum computing". Doc. Math. (Bielefeld) Extra Vol. ICM Berlin, 1998, vol. I. pp. 467–486. https://www.elibm.org/ft/10011733000. 
  21. ↑ Parberry, Ian (May 10, 1999). "1999 Gödel Prize — Peter W. Shor". https://www.sigact.org/prizes/gödel/1999.html. 
  22. ↑ Peter W. Shor – Computer Science, Class of 1999, MacArthur Foundation
  23. ↑ BBVA Foundation Frontiers of Knowledge Award 2019
  24. ↑ Academy Members: 1780–present. Cambridge, Massachusetts: American Academy of Arts & Sciences. 2011. pp. 502. https://www.amacad.org/publications/BookofMembers/ChapterS.pdf. 
  25. ↑ "2011 Members and Their Affiliations". American Academy of Arts & Sciences. https://www.amacad.org/news/alphalist2011.pdf. 
  26. ↑ 2019 ACM Fellows Recognized for Far-Reaching Accomplishments that Define the Digital Age, Association for Computing Machinery, https://www.acm.org/media-center/2019/december/fellows-2019, retrieved December 11, 2019 
  27. ↑ "Peter Shor". https://www.nasonline.org/member-directory/members/20002167.html. 
  28. ↑ "Dr. Peter W. Shor". https://nae.edu/224647/Dr-Peter-W-Shor. 
  29. ↑ Castelvecchi, Davide (2020). "Quantum-computing pioneer warns of complacency over Internet security". Nature 587 (7833): 189. doi:10.1038/d41586-020-03068-9. PMID 33139910. Bibcode: 2020Natur.587..189C. 

External links

Lectures and panels



Retrieved from "https://handwiki.org/wiki/index.php?title=Biography:Peter_Shor&oldid=3671289"