
	Where results make sense

Topic: Peter Shor

Related Topics

Nevanlinna Prize

Timeline of quantum computing

Madhu Sudan

Robert Tarjan

Abel Prize

Donald Knuth

Cryptanalysis

John McCarthy (computer scientist)

Rolf Nevanlinna

Turing Award

Edsger Dijkstra

The Art of Computer Programming

Raj Reddy

Marvin Minsky

Maelor Saesneg

In the News (Sun 29 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Shor's algorithm - Wikipedia, the free encyclopedia
		Shor's algorithm is a quantum algorithm for factoring a number N in O((log N)
		Shor's algorithm was demonstrated in 2001 by a group at IBM, which factored 15 into 3 and 5, using a quantum computer with 7 qubits.
		Shor's period-finding algorithm relies heavily on the ability of a quantum computer to be in many states simultaneously.
	en.wikipedia.org /wiki/Shor's_algorithm (1015 words)

	Shor's algorithm (Site not responding. Last check: 2007-11-06)
		Shor's algorithm was demonstrated in 2001 by group at IBM which factored 15 into 3 and using a quantum computer with 7 qubits.
		Shor's period-finding algorithm relies heavily on the of a quantum computer to be in many states simultaneously.
		Shor thus had to solve three "implementation" All of them had to be implemented which means that they can be implemented a number of quantum gates that is polynomial in $\log N .$
	www.freeglossary.com /Shor%27s_algorithm (1404 words)

	Encyclopedia: Timeline of quantum computing (Site not responding. Last check: 2007-11-06)
		This algorithm introduced the main ideas which were then developed in Peter Shor's factoring algorithm.
		Shor's algorithm could theoretically break many of the cryptosystems in use today.
		Shors algorithm is a quantum algorithm for factoring a number N in O((log N)3) time and O(log N) space, named after Peter Shor.
	www.nationmaster.com /encyclopedia/Timeline-of-quantum-computing (2436 words)

	Peter Shor - Wikipedia, the free encyclopedia
		Peter W. Shor (born August 14, 1959) is an American theoretical computer scientist most famous for his work on quantum computation, in particular for devising a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer (see Shor's algorithm).
		After graduating, he spent one year in a post-doctoral position at Berkeley, and then accepted a position at Bell Laboratories.
		Shor began his current MIT position in 2003.
	en.wikipedia.org /wiki/Peter_Shor (197 words)

	Peter Shor (Site not responding. Last check: 2007-11-06)
		Shor, Boris PhD in molecular and cell biology.
		Peter Area Map Shows where St. Peter is in relation to Mankato, Faribault, and the Twin Cities.
		Peter of Montboissier, better known as Peter the Venerable, general of the Cluniac order, prominent at the General Council of Pisa, commissioned the first Latin translation of the Koran.
	www.serebella.com /encyclopedia/article-Peter_Shor.html (455 words)

	AT&T Labs Research News - Shor Elected to NAS (Site not responding. Last check: 2007-11-06)
		Peter Shor, of the Internet and Network Systems Research Lab, has been elected to the National Academy of Sciences.
		As election to membership in the Academy recognizes distinguished and continuing achievements in original research, it is considered one of the highest honors that can be accorded a U.S. scientist or engineers.
		Earlier this year, Peter was chosen as a winner of the King Faisal International Prize in Science for 2002.
	www.research.att.com /news/2002/June/ShorNAS.html (442 words)

	The adaptive classical capacity of a quantum channel, or Information capacities of three symmetric pure states in three ...
		Peter W. Shor Department of Mathematics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (shor@math.mit.edu).
		In 1994, Dr. Shor showed that if a quantum computer could be constructed, it should be capable of factoring very large numbers and thus make it possible to break the RSA cryptosystem.
		Shor is the recipient of the 1998 International Quantum Communication Award, the 1998 Nevanlinna Prize, the 1999 Dickson Prize in Science, and the 2002 King Faisal Prize in Mathematics.
	www.research.ibm.com /journal/rd/481/shoraut.html (215 words)

	Shor Abstract (Site not responding. Last check: 2007-11-06)
		Peter Shor is mathematician at the AT&T Labs in Florham Park, New Jersey (USA).
		Shor has carried out pioneering work in combinatorial analysis and the theory of quantum computing.
		In June, Shor was named the recipient of the 1999 MacArthur Fellow for his pioneering work in quantum computing, the only one of 32 fellows selected in the computing field and the only one from an industrial lab.
	www.cis.upenn.edu /~colloq/DL-abstracts/shor.html (330 words)

	shor s algorithm (Site not responding. Last check: 2007-11-06)
		Many public key cryptosystems, such as RSA, will become obsolete if Shor's algorithm is ever implemented in a practical quantum computer.
		All of them had to be implemented "fast", which means that they can be implemented with a number of quantum gates that is polynomial in.
		By using controlled NOT gates and single qubit rotation gates Shor designed a circuit for the quantum Fourier transform that uses just gates.
	www.yourencyclopedia.net /shor_s_algorithm.html (1027 words)

	Peter Shor Interview (Site not responding. Last check: 2007-11-06)
		Peter Shor, Morss Professor of Applied Mathematics at MIT, put quantum computing on the map with his integer factoring algorithm in 1994.
		[Peter Shor] The primary focus of my research in the past few years has been on the information-carrying capacities of quantum channels.
		[Peter Shor] One of the big differences between analog and quantum computers is error correction.
	quantum.atticrose.com /peter_shor.html (1048 words)

	TU Berlin - Medieninformation Nr. 184e - 18. August 1998
		At the opening ceremony of the International Congress of Mathematicians in Berlin on Tuesday, Peter Shor was awarded the Nevanlinna Prize for his pioneering work.
		Shor has demonstrated that a quantum computer could be cleverly programmed to allow it to tackle this problem efficiently.
		According to Heisenberg's uncertainty principle, one of the central principles in physics, it is not possible to observe a particle of this magnitude without altering the information that it carries.
	www.tu-berlin.de /presse/pi/1998/pi184e.htm (823 words)

	Shor's algorithm (Site not responding. Last check: 2007-11-06)
		Shor's algorithm is a quantum algorithm for factoring a number N in O ((logN)
		Like all quantum computer algorithms, Shor's algorithm is probabilistic: it gives the correct answer with high probability,and the probability of failure can be decreased by repeating the algorithm.
		To achieve this, Shor used repeated squaring for his modular exponentiationtransformation.
	www.therfcc.org /shor%27s-algorithm-137888.html (943 words)

	Peter Shor - The Quantum Computing (Site not responding. Last check: 2007-11-06)
		Peter Shor (born August 14, 1959) is an American theoretical computer scientist most famous for his work on quantum computation, in particular for devising a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.
		Peter Shor has carried out pioneering work in combination analysis and the theory of quantum computing.
		Shor has been able to prove mathematically that the new computers would mean that current standard encrypting methods such as "RSA", which are used for electronic cash and on-line signatures would no longer be secure.
	www.p-s-site.net (507 words)

	SCHOOL OF COMPUTER SCIENCE/Carnegie Mellon University
		Shor is the 25th recipient of this prize.
		Shor has received several awards and honors for his work, including the Nevanlinna Prize, awarded at the 1998 International Congress of Mathematicians, and the 1998 International Quantum Communication Award.
		Shor, 40, was born in New York City.
	news.cs.cmu.edu /Releases/demo/17.html (528 words)

	Physics
		In 1994, Peter Shor from ATandT Bell Labs has discovered a factorization algorithm that runs in polynomial time, permitting in theory factoring numbers of almost arbitrary size.
		Peter Shor who discovered a polynomial algorithm for factorization of large integers using a quantum computer (see project PA-1), has shown that quantum computations can be used as well to compute discrete logarithms.
		Additionally, you are asked to determine the expected number of repetitions of the algorithm necessary to complete computations, and estimate the number of operations and quantum gates necessary to implement the algorithm for a given size of the modulus P taking into account redundancy introduced by quantum error correction codes.
	bass.gmu.edu /crypto/student_projects/physics.htm (1094 words)

	IBM's test-tube quantum computer makes history
		The simplest meaningful instance of Shor's Algorithm is finding the factors of the number 15, which requires a seven-qubit quantum computer.
		IBM's demonstration of Shor's algorithm also shows the value of quantum computing experiments using NMR, an approach pioneered independently in the mid-1990s by Chuang and Neil Gershenfeld of MIT and by David Cory and colleagues, also at MIT.
		The factorization using Shor's algorithm announced today is the most complex algorithm yet to be demonstrated by a quantum computer.
	www.eurekalert.org /pub_releases/2001-12/ird-itq_1121701.php (857 words)

	Peter Shor - rFind.net (Site not responding. Last check: 2007-11-06)
		Du kan också söka efter Peter Shor i andra artiklar på svenska wikipedia.
		peter nilsson ny vd och koncernchef i trelleborg ab trelleborg abs styrelse har utsett peter nilsson, chef för affärsområdet trelleborg engineered systems, till ny vd och koncernchef i trelleborgkoncer...
		peter lindell styrelseordförande i 42networks ab på 42networks bolagsstämma den 18 maj valdes som styrelseledamöter holger ronquist, krister sundling, peter lindell, urban lindskog och thomas g&uum...
	www.rfind.net /info/Peter_Shor (348 words)

	Business Wire: AT&T Labs' Peter Shor Named 1999 MacArthur ... @ HighBeam Research (Site not responding. Last check: 2007-11-06)
		AT&T Labs today announced that Peter Shor was named a 1999 MacArthur Fellow for his pioneering work in quantum computing, the only one of 32 Fellows selected in the computing field and the only one from an industrial lab.
		In 1994 Shor demonstrated that quantum uncertainty could be harnessed to calculate prime factors of integers substantially faster than any known algorithm based on digital logic.
		Shor will be awarded a total sum of $290,000 over this period.
	www.highbeam.com /library/doc0.asp?docid=1G1:54961946&refid=ink_tptd_g1 (475 words)

	DIMACS Conf. Oct. 26, 2001 (Site not responding. Last check: 2007-11-06)
		Peter Shor was born in 1959 in New York City, and grew up in Washington, D.C. and in the San Francisco Bay area.
		Until 1994, Dr. Shor worked mainly on algorithms for conventional computers (combinatorial algorithms, computational geometry and average-case analysis of algorithms) and also did research in probability and combinatorics.
		In 1998, Dr. Shor was made an AT&T Fellow, received the Nevanlinna Prize at the International Congress of Mathematicians in Berlin and the Quantum Communications Award at the Quantum Communication and Measurement conference in Evanston, Illinois.
	cm.bell-labs.com /cm/ms/events/DIMACSBL/abst_bio.html (1201 words)

	SCS News Releases (Site not responding. Last check: 2007-11-06)
		Computer scientist and mathematician Peter Shor, a principal research scientist at AT&T Labs (Florham, N.J.), is the recipient of Carnegie Mellon University=B9s 1998 Dickson Prize in Science for his pioneering research in the theory of quantum computing.
		However, the possibilities of such a device were not appreciated until 1994, when Shor discovered an algorithm for factoring large integers or whole numbers into prime numbers on a quantum computer.
		However, a device which could actually carry out Shor's algorithm for large numbers is still many years away, because numerous technical difficulties have to be overcome.
	www-2.cs.cmu.edu /~scsnews/nov5-99.html (538 words)

	Shor's algorithm (Site not responding. Last check: 2007-11-06)
		Shor's algorithm is a quantum algorithm for factoring a number ''N in O ((log N)
		= Shor's period-finding algorithm relies heavily on the ability of a quantum computer to be in many states simultaneously.
		Physicists call this behaviour a " superposition " of states.
	www.serebella.com /encyclopedia/article-Shor's_algorithm.html (1106 words)

	FXPAL - Publication Abstract (Site not responding. Last check: 2007-11-06)
		Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects.
		This speculation appeared justified when Peter Shor described a polynomial time quantum algorithm for factoring integers.
		Various approaches to harnessing the power of quantum parallelism are explained, including Shor's algorithm, Grover's algorithm, and Hogg's algorithms.
	www.fxpal.com /?p=abstract&print=1&abstractID=38 (191 words)

	Algoritmo de Shor (Site not responding. Last check: 2007-11-06)
		El algoritmo de Shor es un algoritmo cuántico para descomponer en factores un número N en tiempo O((log N)) y espacio O(log N), así nombrado por Peter Shor.
		El algoritmo de Shor fue demostrado en 2001 por un grupo en IBM, que descompuso 15 en sus factores 3 y 5, usando una computadora cuántica con 7 cubits.
		Shor tuvo que solucionar así tres "problemas de implementación".
	enciclopedia.cc /Algoritmo_de_Shor (1133 words)

	Peter Shor - TheBestLinks.com - Applied mathematics, August 14, Computer science, Massachusetts Institute of ...
		Peter Shor - TheBestLinks.com - Applied mathematics, August 14, Computer science, Massachusetts Institute of Technology,...
		Peter Shor, Applied mathematics, August 14, Computer science, Massachusetts...
		Peter Shor (born August 14, 1959) is an American theoretical computer scientist most famous for his work on quantum computation, in particular for devising a quantum algorithm for factoring exponentially faster than a classical computer (see Shor's algorithm).
	www.thebestlinks.com /Peter_Shor.html (236 words)

	Shor's algorithm - Encyclopedia, History, Geography and Biography
		All of them had to be implemented "fast", which means that they can be implemented with a number of quantum gates that is polynomial in $\log N$ .
		By using controlled NOT gates and single qubit rotation gates Shor designed a circuit for the quantum Fourier transform that uses just $O((\log N)^2)$ gates.
		The article about Shor's algorithm contains information related to Shor's algorithm, Procedure, Classical part, Quantum part: Period-finding subroutine:, Explanation of the algorithm, I. Obtaining factors from period, II.
	www.arikah.net /encyclopedia/Shor%27s_algorithm (1097 words)

	PETER W. SHOR
		Peter Shor (1959) informatico teorico noto per i contributi al calcolo quantistico.
		In particolare nel 1994, mentre lavorava ai Bell Laboratories, ha inventato quello che oggi è noto come algoritmo di Shor per la fattorizzazione.
		Nel 1981 ha ricevuto il B.S. in matematica dal Caltech e nel 1985 presso il MIT ha conseguito il Ph.D. in matematica applicata con una tesi sull'analisi probabilistica degli algoritmi di bin-packing sotto la supervisione di Tom Leighton.
	www.24pm-affiliation.com /encyclopedia/P/Peter_W._Shor (143 words)

Try your search on: Qwika (all wikis)