Jump to content

Shor's algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 167.206.78.xxx (talk) at 18:45, 7 January 2002 (intial entry). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Shors algorithm is a mathematical formula devised for quantum computers which enables them to find the [[|factor|factors]] of a number. This is important because modern cryptography is based on factors of large numbers, and an efficient method of factoring would make large numbers of security systems useless. Shors algorithm was recently demonstrated when IBM factored 15 into 3 and 5 on a qunatum computer.