1994 paper by MIT professor Peter Shor. If this algorithm is run on a QC with 4,000 qubits or more, it can break a class of cryptography algorithms under “asymmetric cryptography,” with RSA as the most well-known of such algorithms. Some people credit this paper with igniting interest in quantum computers.
