Peter Shor works at AT&T research labs and found the famous factorizing algorithm for quantum computers in 1994. This algorithm manages to factorize the product of two large prime numbers efficiently (i.e. in polynomial time) on q-computers. As yet no efficient algorithm for classical computers has been found and this discovery gives rise to assumptions concerning the inequality of the computing-powers of quantum and classical computers.

Log in or register to write something here or to contact authors.