Yahoo Search Busca da Web

Resultado da Busca

  1. en.wikipedia.org › wiki › Peter_ShorPeter Shor - Wikipedia

    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.

  2. Peter Williston Shor ( Nova Iorque, 14 de agosto de 1959) é um matemático estadunidense . É professor de matemática aplicada no Instituto de Tecnologia de Massachusetts (MIT), conhecido por seu trabalho em computação quântica, em particular pela elaboração do algoritmo de Shor, um algoritmo quântico para fatorar ...

  3. 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.

  4. 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.

  5. 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.

  6. 22 de set. de 2022 · MIT professor Peter Shor is recognized for his groundbreaking work in quantum information, including the Shor's algorithm for factoring large numbers and quantum error correction. He shares the $3 million prize with three other pioneers in the field.

  7. Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (non-quantum ...