Toward a code-breaking quantum computer

MIT researchers have enhanced a theoretical quantum factoring algorithm to be as swift as a process developed by an NYU computer scientist, but more memory-efficient and with better fault tolerance. This approach could boost development of encryption methods to resist quantum computers’ code-breaking power. Despite huge advances, scientists are yet to create a quantum computer adequate for running MIT’s algorithm and existing quantum computers’ gate-induced noise degrades their performance. Researchers aim to enhance their algorithm’s efficiency for factoring sub-2,048-bit integers.