Peter Shor

from Wikipedia, the free encyclopedia
Peter Shor (2018)

Peter Wiliston Shor (born August 14, 1959 in New York ) is an American mathematician and computer scientist , known as the inventor of a quantum computer algorithm.

Life

Shor went to high school in Mill Valley , California and won a second prize as a student in the 1977 Mathematical Olympiad, in which the US team scored the most points. He studied as a Putnam Fellow at Caltech in Pasadena up to his bachelor's degree in 1981 and then went to MIT , where he did his doctorate in 1985 with Tom Leighton on the probabilistic analysis of the container problem. After a year as a post-doc at Berkeley , he accepted a position at the Bell Lab in Murray Hill , New Jersey . He also taught at MIT, where he has also been Professor of Applied Mathematics since 2003.

Shor is best known for his development of a factorization algorithm with polynomial running time for quantum computers, which helped this part of computer science to break through in the 1990s ( Shor algorithm ). The algorithm, first presented in 1994, uses the very large parallel computational abilities ( superposition principle of wave functions in quantum mechanics) of a potential quantum computer and uses the quantum Fourier transformation . Its special significance lies in the fact that it is the first quantum algorithm to solve a practically relevant problem and has been shown to be exponentially faster than the best known algorithm for conventional computers. A second result of Shor, which was decisive for the development of quantum computing, was his discovery of the first error-correcting quantum code (the 9-qubit Shor code ) and the subsequent proof that a fault-tolerant quantum computer can be constructed using such codes . Shor also made important contributions and a. on the theory of entanglement and quantum channels .

In 1998 Shor received the Nevanlinna Prize at the International Congress of Mathematicians in Berlin , where he gave one of the plenary lectures (Quantum Computing). In 1999 he received a MacArthur Fellowship .

In 1998 Shor was awarded the Dickson Prize in Science . In 2002 he was elected to the National Academy of Sciences , 2011 to the American Academy of Arts and Sciences , 2020 to the National Academy of Engineering . He was awarded the Dirac Medal (ICTP) for 2017 and the BBVA Frontiers of Knowledge Award for 2019 . Shor has been a fellow of the Association for Computing Machinery since 2019 .

Fonts (selection)

Quantum computing

geometry

  • A. Aggarwal, MM Klawe, S. Moran, PW Shor, R. Wilber: Geometric applications of a matrix-searching algorithm . In: Algorithmica . tape 2 , no. 1 , 1987, pp. 195-208 .
  • KL Clarkson, PW Shor: Applications of random sampling in computational geometry . In: Discrete & Computational Geometry . tape 4 , no. 1 , 1989, pp. 387-421 .
  • A. Aggarwal, LJ Guibas, J. Saxe, PW Shor: A linear-time algorithm for computing the voronoi diagram of a convex polygon . In: Discrete & Computational Geometry . tape 4 , no. 1 , 1989, pp. 591-604 .
  • JC Lagarias, PW Shor: Keller's cube-tiling conjecture is false in high dimensions . In: Bull. Am. Math. Soc. tape 27 , no. 2 , 1992, p. 279–283 ( with.edu [PDF]).

Combinatorics

  • T. Leighton, PW Shor: Tight bounds for minimax grid matching with applications to the average case analysis of algorithms . In: Combinatorica . tape 9 , no. 2 , 1989, pp. 161-187 .
  • A. Björner, L. Lovász, PW Shor: Chip-firing Games on Graphs . In: Europ. J. Combinat. tape 12 , no. 4 , 1991, pp. 283-291 .

Web links

Individual evidence

  1. ^ Famous Residents. Mill Valley Historical Society, accessed March 3, 2020 .
  2. ↑ PW Shor: Random Planar Matching and Bin packing . 1985 ( mit.edu - PhD Thesis at the Department of Mathematics at MIT).
  3. ↑ PW Shor: Algorithms for quantum computation: Discrete logarithms and factoring . In: Proceedings, 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, November 20-22, 1994 . IEEE Computer Society Press, 1994, pp. 124-134 ( with.edu [PDF]).
  4. ↑ MA Nielsen, IL Chuang: Quantum Computation and Quantum Information . Cambridge University Press, 2000, pp. 6/7, p. 246 .
  5. ↑ Andrew Steane also discovered such a code almost simultaneously and independently of Shor ; see. MA Nielsen, IL Chuang: Quantum Computation and Quantum Information . Cambridge University Press, 2000, chap. 10, pp. 497f .
  6. ↑ Fault-tolerant quantum computation . In: 37th Symposium on Foundations of Computing . IEEE Computer Society Press, 1996, pp. 56-65 , arxiv : quant-ph / 9605011 .
  7. ↑ DP DiVincenzo, T. Mor, PW Shor, JA Smolin, BM Terhal: Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement . In: Comm. Math. Phys. tape 238 , 2003, p. 379-410 , doi : 10.1007 / s00220-003-0877-6 , arxiv : quant-ph / 9908070 .
  8. ↑ M. Horodecki, PW Shor, MB Ruskai: General Entanglement Breaking Channels . In: Rev. Math. Phys . tape 15 , 2003, p. 629-641 , doi : 10.1142 / S0129055X03001709 , arxiv : quant-ph / 0302031 .
  9. ↑ The BBVA Foundation recognizes Charles H. Bennett, Gilles Brassard and Peter Shor for their fundamental role in the development of quantum computation and cryptography. fbbva.es, March 3, 2020, accessed on March 3, 2020 .
personal data
SURNAME Shor, Peter
ALTERNATIVE NAMES Shor, Peter Wiliston (full name)
BRIEF DESCRIPTION American mathematician
DATE OF BIRTH August 14, 1959
PLACE OF BIRTH New York City , New York