Resultado de búsqueda
Peter Shor Williston (nacido el 14 de agosto de 1959) es un profesor estadounidense de matemáticas aplicadas en el MIT, famoso por su trabajo en computación cuántica, en particular por elaborar el algoritmo de Shor, un algoritmo cuántico de factorización exponencialmente más rápido que el mejor algoritmo conocido actualmente que se ...
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.
Interests: My mathematical research is currently mainly in quantum computing and quantum information theory, but I am also interested in (and have in the past worked in) algorithms, computational geometry, combinatorics, and probability theory.
En computación cuántica, el algoritmo de Shor es un algoritmo cuántico para descomponer en factores un número N en tiempo O((log N) 3) y espacio O(logN), así nombrado por Peter Shor. El algoritmo de Shor es un procedimiento que permite encontrar factores de un número de una manera eficiente.
10 de mar. de 2023 · Peter Shor, the Morss Professor of Applied Mathematics, shares a brief history of quantum computing from a personal viewpoint. He recounts his discovery of Shor's algorithm, which showed how a quantum computer could factorize large numbers, and its impact on cryptography and information science.
Peter Shor is a renowned theoretical computer scientist and quantum computing pioneer. He has received numerous awards and honors, including the Gödel Prize, the Dirac Medal, and the Killian Award from MIT.
30 de oct. de 2020 · Peter Shor, who discovered how to factor large numbers on a quantum computer, talks to Nature about the challenges and opportunities of quantum computing. He warns of the risks of complacency and the need for post-quantum encryption.
