پيتر شور

لا يجب الخلط بين موضوع المقال و the British politician Peter Shore.
پيتر شور
Peter Shor
Peter Shor.jpg
وُلِدَ14 أغسطس 1959 (العمر 66 سنة)
مدينة نيويورك، نيويورك، الولايات المتحدة
القوميةأمريكي
المدرسة الأممعهد كاليفورنيا للتكنولوجيا
معهد مساتشوستس للتكنولوجيا
عـُرِف بـShor's algorithm
الجوائزPutnam Fellow (1978)[1]

Nevanlinna Prize (1998)[2]
MacArthur Fellowship (July 1999)[3]
Gödel Prize (1999)[4]

King Faisal International Prize (2002)[5]
السيرة العلمية
المجالاتعالم كمپيوتر
الهيئاتمعهد مساتشوستس للتكنولوجيا
Bell Labs
المشرف على الدكتوراهTom Leighton

پيتر ولستون شور Peter Williston Shor، (ولد 14 أغسطس 1959) هو أستاذ أمريكي في الرياضيات التطبيقية في معهد مساتشوستس للتكنولوجيا، اشتهر بعمله على حساب الكم، وخاصة اكتشافه خوارزمية شور، وخوارزمية الكمfor factoring exponentially faster than the best currently-known algorithm running on a classical computer.

تعليمه

Shor was born on August 14, 1959, in New York City, to Joan Bopp Shor and S. W. Williston Shor.[6][7] He grew up in Washington, D.C. and Mill Valley, California.[6] While attending Tamalpais High School, he placed third in the 1977 USA Mathematical Olympiad.[8] 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).[9][10]

Shor graduated from the California Institute of Technology (Caltech) in 1981 with a B.S. in mathematics.[11] He was a Putnam Fellow in 1978. He then did doctoral study in applied mathematics at MIT, receiving a Ph.D. in 1985.[12] 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. Shor first found an efficient quantum algorithm for 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."[13]

Both of these problems are examples of the HSP. For his work discovering the efficient quantum algorithms for factoring and discrete logarithm he was awarded the Nevanlinna Prize at the 23rd International Congress of Mathematicians in 1998[14][15] and the Gödel Prize in 1999.[16] In 1999, he was awarded a MacArthur Fellowship.[17] In 2017, he received the Dirac Medal of the ICTP and for 2019 the BBVA Foundation Frontiers of Knowledge Award in Basic Sciences.[18]

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.[19] He also is affiliated with CSAIL.[20]

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

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

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.[26]

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

انظر أيضا

الهامش

  1. ^ "The Mathematical Association of America's William Lowell Putnam Competition". Mathematical Association of America. Retrieved 2007-02-12.
  2. ^ "Fields Medalists / Nevanlinna Price Winner 1998 [sic]". International Mathematical Union. 2006-08-22. Retrieved 2010-09-26.
  3. ^ "Fellows List - July 1999". John D. and Catherine T. MacArthur Foundation. Retrieved 2007-02-12.
  4. ^ Parberry, Ian (1999-05-10). "1999 Gödel Prize". ACM SIGACT. Retrieved 2007-02-12.
  5. ^ "2002 King Faisal International Prizes for Science Announced". King Faisal Foundation.
  6. ^ أ ب Joan Shor Obituary.
  7. ^ '[1], Shor Family History
  8. ^ 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
  9. ^ Mill Valley Historical Society, 2004, 'History of Homestead Valley' Archived أغسطس 21, 2006 at the Wayback Machine
  10. ^ Stephen R. Dunbar, 'Identifying Talent: American Mathematics Competitions,' in Mathematical Association of America, Focus, Vol 24, Issue 3, March 2004, p 29
  11. ^ أ ب "2007 Recipients". Distinguished Alumni Award. Caltech Alumni Association. Archived from the original on July 16, 2011. Retrieved April 22, 2010.
  12. ^ Shor, Peter Williston (September 1985). Random Planar Matching and Bin Packing (Ph.D. thesis). MIT. OCLC 14107348.
  13. ^ Shor, Peter W. (2022-08-21). "The Early Days of Quantum Computation". arXiv:2208.09964 [quant-ph].
  14. ^ Jackson, Allyn (November 1998). "Peter Shor Receives Nevanlinna Prize" (PDF). Notices of the AMS: 1361.
  15. ^ Shor, Peter (1998). "Quantum computing". Doc. Math. (Bielefeld) Extra Vol. ICM Berlin, 1998, vol. I. pp. 467–486.
  16. ^ Parberry, Ian (May 10, 1999). "1999 Gödel Prize — Peter W. Shor". sigact.org.
  17. ^ Peter W. Shor – Computer Science, Class of 1999, MacArthur Foundation
  18. ^ BBVA Foundation Frontiers of Knowledge Award 2019
  19. ^ "Department of Mathematics Faculty and Teaching Staff". Catalog. MIT. Retrieved 2024-05-19.
  20. ^ "Peter Shor". People. MIT CSAIL. Retrieved 2024-05-19.
  21. ^ Academy Members: 1780–present (PDF). Cambridge, Massachusetts: American Academy of Arts & Sciences. 2011. p. 502.
  22. ^ "2011 Members and Their Affiliations" (PDF). American Academy of Arts & Sciences. Archived from the original (PDF) on March 19, 2012. Retrieved October 17, 2011.
  23. ^ 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 on December 11, 2019 
  24. ^ "Peter Shor". www.nasonline.org. Retrieved March 28, 2021.
  25. ^ "Dr. Peter W. Shor". NAE Website. Retrieved September 9, 2021.
  26. ^ Castelvecchi, Davide (2020). "Quantum-computing pioneer warns of complacency over Internet security". Nature. 587 (7833): 189. Bibcode:2020Natur.587..189C. doi:10.1038/d41586-020-03068-9. PMID 33139910. S2CID 226243008.
  27. ^ خطأ استشهاد: وسم <ref> غير صحيح؛ لا نص تم توفيره للمراجع المسماة mit-news-breakthrough

وصلات خارجية

المحاضرات والندوات

This article contains content from Wikimedia licensed under CC BY-SA 4.0. Please comply with the license terms.
تمّ الاسترجاع من "https://www.marefa.org/w/index.php?title=پيتر_شور&oldid=4155892"