"Toward a Code-Breaking Quantum Computer"

MIT researchers have proposed a way to make a smaller, more noise-tolerant quantum factoring circuit for cryptography. Quantum computers are expected to quickly break complex cryptographic systems that classical computers cannot, a promise based on a quantum factoring algorithm proposed by MIT professor Peter Shor in 1994. Although researchers have made progress in the last 30 years, they have yet to build a quantum computer that is powerful enough to run Shor's algorithm. While some researchers work to develop larger quantum computers, others have been trying to improve Shor's algorithm to run on a smaller quantum circuit. New York University computer scientist Oded Regev proposed a significant theoretical improvement a year ago. His algorithm could run faster, but the circuit would need more memory. Based on this development, MIT researchers propose an approach that combines Regev's speed and Shor's memory efficiency. Their new algorithm could help develop encryption methods capable of withstanding the code-breaking power of quantum computers. This article continues to discuss the new algorithm that requires fewer quantum building blocks and has a higher tolerance to quantum noise.

MIT News reports "Toward a Code-Breaking Quantum Computer"

Submitted by grigby1