Search results
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.
Peter Shor Contact information Current Course My Fall 2023 course is 18.424. Here is the Course Info page for last year Quantum Computation Lecture Notes Here are my lecture notes from the fall 2022 course on quantum computation, 8.170/18.435.
Peter Shor is Morss Professor of Applied Mathematics since 2003. He received the B.A. in mathematics from Caltech in 1981, and the Ph.D. in applied mathematics from MIT in 1985, under the direction of Tom Leighton. Following a postdoctoral fellowship at MSRI, he joined AT&T. He was a member of its Research staff, 1986-2003.
Mar 10, 2023 · Caption: Peter Shor, the Morss Professor of Applied Mathematics, is this year’s recipient of the James R. Killian, Jr. Faculty Achievement Award, which is the highest honor the Institute faculty can bestow upon one of its members each academic year.
Peter Shor Contact information My Home Page Lecture Notes Here are the 2022 Lecture notes. I never got around to writing the notes for Lecture 26 --- I may or may not do that at some point in the future. Lecture 1--- Introduction and History Lecture 2--- The Superposition Principle Lecture 3--- Unitary Evolution and the Bloch Sphere
Sep 22, 2022 · Peter Shor, the Morss Professor of Applied Mathematics at MIT, has been named a recipient of the 2023 Breakthrough Prize in Fundamental Physics. He shares the $3 million prize with three others for “foundational work in the field of quantum information”: David Deutsch at the University of Oxford, Charles Bennett at IBM Research, and Gilles Brassard of the University of Montreal.
Unextendible Product Bases and Bound Entanglement (Postscript) by David P. Divincenzo, Tal Mor, Peter Shor, John A. Smolin and Barbara M. Terhal (4 pages) This shows how to construct states with bound (non-distillable) entanglement in a simpler manner than Horodecki's original construction of them, by relating them to unextendible product bases.
