(PhysOrg.com) -- Theoretically, quantum computing has the potential to work more efficiently and accurately than classical computing for certain processes, such as factoring. But quantum methods are ...

SAN JOSE, Calif., -- Scientists at IBM's Almaden Research Center have performed the world's most complicated quantum-computer calculation to date. They caused a billion billion custom-designed ...

In 1994, Peter Shor, an American mathematician working at Bell Labs, published a paper with a wonky title and earth-shaking implications. In “Polynomial-Time Algorithms for Prime Factorization and ...

A quantum computer algorithm that is used to find the prime factors in an encryption key. Created by applied mathematician Peter Shor in the mid-1990s, Shor's algorithm may be used to break the codes ...

In 1994, MIT professor of applied mathematics Peter Shor developed a groundbreaking quantum computing algorithm capable of factoring numbers (that is, finding the prime numbers for any integer N) ...

This article was published in Scientific American’s former blog network and reflects the views of the author, not necessarily those of Scientific American Peter Shor is a poet. Here is a limerick he ...