图:International Centre for Theoretical Physics · CC BY 3.0 · Wikimedia Commons
彼得·秀尔1959—
Peter Shor
美国计算机科学家
彼得·威利斯顿·肖尔,出生于美国纽约市,美国计算机科学家,目前为美国麻省理工学院的应用数学系教授,提出了在量子电脑应用上的“肖尔算法”(又称量子质因数分解算法),因其证明量子电脑能做出对数运算,而且速度远胜传统电脑,对于现在通行于银行及网络等处的RSA加密算法可以破解而构成威胁。
摘自维基百科「彼得·秀爾」,CC BY-SA 4.0
- 出生
- 1959 年 8 月 14 日,纽约
- 国籍
- 美国
- 学科
- 数学、计算机科学、博物与综合
- 职业
- 数学家、计算机科学家、大学教师
- 母校
- 加州理工学院、麻省理工学院、塔马尔佩斯高中
- 工作单位
- 麻省理工学院
研究领域
主要贡献
代表成就
本站收录的发现与发明
以他 / 她命名
师承
博士导师1
博士生11
来自 Wikidata 的「博士导师」「师从」「博士生」「学生」记录,可能不全。
学术谱系
往上:老师的老师7 代
往下:学生的学生1 代 · 11 人
- 彼得·秀尔
- Alan Wing Leung
- Mohsen Bahramgiri
- Andrew Stephen Fletcher
- Salman Beigi
- Reina Riemann
- Amanda Epping Redlich
- Ramis Movassagh
- Jesse T. Geneson
- Dimiter Ostrev
- Joungkeun Lim
- Matthew Coudron
按 Wikidata 的「博士导师」「师从」「博士生」「学生」记录逐代连起来(往上每人最多列 3 位老师、最多 7 代;往下最多 3 代、每人最多列 12 位学生)。记录不全,只是能查到的部分。
所获奖项(12)
- 1998内万林纳奖
- 1998O'Reilly开源奖
- 1998International Quantum Communication Award
- 1999哥德尔奖
- 1999Dickson Prize in Science
- 2002King Faisal Prize in Science
- 2010约西亚·威拉德·吉布斯讲座
- 2017狄拉克奖章(ICTP)
- 2018IEEE埃里克·E·萨姆纳奖
- 2019ACM会士
- 2022美国数学会会士
- —麦克阿瑟天才奖
学会与院士
百科正文
生平事迹
在他求学生涯结束后, 他花了一年的时间在柏克莱加州大学当博士后研究员(post-doctoral),随后则去了贝尔实验室当研究员,这里也是他提出量子质因数分解算法的地方,1998年他获得了奈望林纳奖。
以上内容摘自维基百科「彼得·秀爾」,按 CC BY-SA 4.0 使用,去掉了参考文献、外部链接等尾部小节,公式改写成了纯文本。全文、配图和出处见原文。
英文维基百科补充中文条目比较短,下面是英文条目「Peter Shor」的原文
Peter Williston Shor (born August 14, 1959) is an American theoretical computer scientist 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. He has been a professor of applied mathematics at the Massachusetts Institute of Technology (MIT) since 2003.
Early life and education
Shor was born on August 14, 1959, in New York City, to Joan Bopp Shor and S. W. Williston Shor. He grew up in Washington, D.C. and Mill Valley, California. While attending Tamalpais High School, he placed third in the 1977 USA Mathematical Olympiad. 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).
Shor graduated from the California Institute of Technology (Caltech) in 1981 with a B.S. in mathematics. He was a Putnam Fellow in 1978. He then did doctoral study in applied mathematics at MIT, receiving a Ph.D. in 1985. 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 that 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."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 and the Gödel Prize in 1999. In 1999, he was awarded a MacArthur Fellowship. In 2017, he received the Dirac Medal of the ICTP and for 2019 the BBVA Foundation Frontiers of Knowledge Award in Basic Sciences.
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.
He received a Distinguished Alumni Award from Caltech in 2007.
On October 1, 2011, he was inducted into the American Academy of Arts and Sciences. He was elected as an ACM Fellow in 2019 "for contributions to quantum-computing, information theory, and randomized algorithms". He was elected as a member of the National Academy of Sciences in 2002. In 2020, he was elected a member of the National Academy of Engineering for pioneering contributions to quantum computation.
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.
Along with three others, Shor was awarded the 2023 Breakthrough Prize in Fundamental Physics for "foundational work in the field of quantum information."
Personal life
Through his father, S. W. Williston Shor, he is a descendant of Samuel Wendell Williston.
以上内容摘自英文维基百科「Peter Shor」,按 CC BY-SA 4.0 使用,去掉了参考文献、外部链接等尾部小节,公式改写成了纯文本。全文、配图和出处见原文。
同年获同一奖项
同一学科、同时代的科学家
同一学科的科学家
更多 ›




