Resultado de búsqueda
舒尔算法，即秀尔算法（Shor算法），以数学家彼得·秀尔命名，是一个在1994年发现的，针对整数分解这题目的的量子算法（在量子计算机上面运作的算法）。它解决如下题目：给定一个整数N，找出他的质因数。
Aquí nos gustaría mostrarte una descripción, pero el sitio web que estás mirando no lo permite.
30 de ago. de 1995 · View a PDF of the paper titled Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, by Peter W. Shor (AT&T Research) View PDF Abstract: A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a ...
L'introduzione di Peter Shor è quella di un algoritmo quantistico in grado di fornire l'ordine in "tempo polinomiale" nella [non chiaro] lunghezza di . L'algoritmo utilizza la codifica e l'estrazione di informazioni (tramite la trasformata di Fourier quantistica ) dalle fasi relative tra gli stati quantistici ( qubit ), proprietà che non ha un equivalente classico.
Peter W. Shor (ur. 14 sierpnia 1959 roku w Nowym Jorku) – amerykański informatyk teoretyk i matematyk, pracownik AT&T Bell Laboratories w Murray Hill w stanie New Jersey. Shor jest najbardziej znany jako autor kwantowego algorytmu nazwanego od jego nazwiska.
Peter Shor (New York, United States, 1959) completed a BA in Mathematics at the California Institute of Technology in 1981 then went on to obtain a PhD in 1985 from the Massachusetts Institute of Technology.After a year as a postdoc at the Mathematical Sciences Research Institute, Berkeley, he joined AT&T Bell Laboratories, where he remained for ten years, then moved to AT&T Shannon Labs from ...
28 de sept. de 2021 · In 1994, a mathematician named Peter Shor surprised the world by publishing an efficient quantum algorithm for finding the prime factors of very large numbers, which is the basis for today’s data encryption. This discovery spurred the further development of quantum computing, making Shor’s algorithm one of the most important algorithms.
