Editing Peter Shor (section)

== 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 Laboratories|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_logarithm|discrete log problem]] (which relates point-finding on a hypercube to a torus) and,<blockquote>"Later that week, I was able to solve the factoring problem as well. There’s a strange relation between discrete log and factoring."<ref>{{Cite arXiv |last=Shor |first=Peter W. |date=2022-08-21 |title=The Early Days of Quantum Computation |class=quant-ph |eprint=2208.09964}}</ref></blockquote>Both of these problems are examples of the [[Hidden subgroup problem|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<ref>{{cite journal|author=Jackson, Allyn|title=Peter Shor Receives Nevanlinna Prize|journal=Notices of the AMS|date=November 1998|page=1361|url=https://www.ams.org/notices/199810/comm-nevanlinna.pdf}}</ref><ref>{{cite book|author=Shor, Peter|chapter=Quantum computing|title=Doc. Math. (Bielefeld) Extra Vol. ICM Berlin, 1998, vol. I|year=1998|pages=467–486|chapter-url=https://www.elibm.org/ft/10011733000}}</ref> and the [[Gödel Prize]] in 1999.<ref>{{cite web|author=Parberry, Ian|title=1999 Gödel Prize — Peter W. Shor|website=sigact.org|date=May 10, 1999|url=https://www.sigact.org/prizes/gödel/1999.html}}</ref> In 1999, he was awarded a [[MacArthur Fellowship]].<ref>[https://www.macfound.org/fellows/623/ Peter W. Shor – Computer Science, Class of 1999], [[MacArthur Foundation]]</ref> In 2017, he received the [[Dirac Medal (ICTP)|Dirac Medal of the ICTP]] and for 2019 the [[BBVA Foundation Frontiers of Knowledge Award]] in Basic Sciences.<ref>[https://www.frontiersofknowledgeawards-fbbva.es/ BBVA Foundation Frontiers of Knowledge Award 2019]</ref>

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.<ref>{{cite web|url=https://catalog.mit.edu/schools/science/mathematics/#facultystafftext|title=Department of Mathematics Faculty and Teaching Staff|work=Catalog|publisher=MIT|access-date=2024-05-19}}</ref> He also is affiliated with [[CSAIL]].<ref>{{cite web|url=https://www.csail.mit.edu/person/peter-shor|title=Peter Shor|work=People|publisher=MIT CSAIL|access-date=2024-05-19}}</ref>

He received a Distinguished Alumni Award from Caltech in 2007.<ref name=Caltech/>

On October 1, 2011, he was inducted into the [[American Academy of Arts and Sciences]].<ref>{{cite book|title=Academy Members: 1780–present|year=2011|publisher=American Academy of Arts & Sciences|location=Cambridge, Massachusetts|pages=502|url=http://www.amacad.org/publications/BookofMembers/ChapterS.pdf}}</ref><ref>{{cite web|url=http://www.amacad.org/news/alphalist2011.pdf|title=2011 Members and Their Affiliations|publisher=American Academy of Arts & Sciences|access-date=October 17, 2011|archive-url=https://web.archive.org/web/20120319172054/http://www.amacad.org/news/alphalist2011.pdf|archive-date=March 19, 2012|url-status=dead}}</ref> He was elected as an [[ACM Fellow]] in 2019 "for contributions to quantum-computing, information theory, and randomized algorithms".<ref>{{citation|url=https://www.acm.org/media-center/2019/december/fellows-2019|title=2019 ACM Fellows Recognized for Far-Reaching Accomplishments that Define the Digital Age|publisher=Association for Computing Machinery|access-date=December 11, 2019}}</ref> He was elected as a member of the [[National Academy of Sciences]] in 2002.<ref>{{Cite web|title=Peter Shor|url=http://www.nasonline.org/member-directory/members/20002167.html|access-date=March 28, 2021|website=www.nasonline.org}}</ref> In 2020, he was elected a member of the [[National Academy of Engineering]] for pioneering contributions to quantum computation.<ref>{{Cite web|title=Dr. Peter W. Shor|url=https://nae.edu/224647/Dr-Peter-W-Shor|access-date=September 9, 2021|website=NAE Website}}</ref>

In an interview published in ''[[Nature (journal)|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.<ref>{{cite journal | doi=10.1038/d41586-020-03068-9 | title=Quantum-computing pioneer warns of complacency over Internet security | year=2020 | last1=Castelvecchi | first1=Davide | journal=Nature | volume=587 | issue=7833 | page=189 | pmid=33139910 | bibcode=2020Natur.587..189C | s2cid=226243008 }}</ref>

Along with three others, Shor was awarded the 2023 [[Breakthrough Prize in Fundamental Physics]] for "foundational work in the field of quantum information."<ref name=mit-news-breakthrough />