Peter Shor
From Wikipedia, the free encyclopedia
| Peter Shor | |
| Born | August 14, 1959 New York City, New York, U.S. |
|---|---|
| Residence | United States of America |
| Nationality | American |
| Fields | Computer Scientist |
| Institutions | MIT |
| Alma mater | Caltech MIT |
| Doctoral advisor | Tom Leighton |
| Known for | Shor's algorithm |
| Notable awards | Putnam Fellow (1978)[1] Nevanlinna Prize (1998)[2] |
Peter Williston Shor (born August 14, 1959) is an American professor of applied mathematics at MIT, most famous 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.
Contents |
[edit] Education
While attending Tamalpais High School, in Mill Valley, California, he placed third in the 1977 USA Mathematical Olympiad.[5] After graduating that year, he won a second prize at the International Math Olympiad in Yugoslavia (the U.S. team achieved the most points per country this year).[6][7] He received his B.S. in Mathematics in 1981 for undergraduate work at Caltech, and was a Putnam Fellow in 1978. He then earned his Ph.D. in Applied Mathematics from MIT in 1985. His doctoral advisor was Tom Leighton, and his thesis was on probabilistic analysis of bin-packing algorithms.
[edit] Career
After graduating, he spent one year in a post-doctoral position at Berkeley, and then accepted a position at Bell Laboratories.
It was here he developed Shor's algorithm, for which he was awarded the Rolf Nevanlinna Prize at the 23rd International Congress of Mathematicians in 1998.
Shor began his current MIT position in 2003. In the past, Shor has taught MIT courses 18.310: Principles of Applied Mathematics, 18.409: Quantum Information Science, 18.435: Quantum Computation, 18.091: Mathematical Exposition, and 18.424: Seminar in Information Theory. Shor is currently teaching 18.434: Seminar in Theoretical Computer Science. Shor always refers to Shor's Algorithm as "the Factoring Algorithm".
Currently a professor in the Department of Mathematics at MIT, he also is affiliated with CSAIL and the Center for Theoretical Physics (CTP)
[edit] Notes
- ^ "The Mathematical Association of America's William Lowell Putnam Competition". Mathematical Association of America. http://www.maa.org/awards/putnam.html. Retrieved on 2007-02-12.
- ^ "Nevanlinna Prize Winners". International Mathematical Union. 2006-08-22. http://www.mathunion.org/Prizes/Nevanlinna/Prizewinners.html. Retrieved on 2007-02-12.
- ^ "Fellows List - July 1999". John D. and Catherine T. MacArthur Foundation. http://www.macfound.org/site/c.lkLXJ8MQKrH/b.1142725/k.2948/Fellows_List__July_1999.htm. Retrieved on 2007-02-12.
- ^ Parberry, Ian (1999-05-10). "1999 Gödel Prize". ACM SIGACT. http://sigact.acm.org/prizes/godel/1999.html. Retrieved on 2007-02-12.
- ^ Murray Klamkin (Editor). Mathematical Association of America (January 1989). USA Mathematical Olympiads 1972-1986 Problems and Solutions (Anneli Lax New Mathematical Library), ISBN 0883856344 ISBN 978-0883856345, accessed May 10, 2007
- ^ Mill Valley Historical Society, 2004, 'History of Homestead Valley'
- ^ Stephen R. Dunbar, 'Identifying Talent: American Mathematics Competitions,' in Mathematical Association of America, Focus, Vol 24, Issue 3, March 2004, p 29
[edit] External links
- DBLP: Peter W. Shor.
- Peter Shor's Home Page at MIT.
- Quantum Computing Expert Peter Shor Receives Carnegie Mellon's 1998 Dickson Prize in Science.
|
|||||
