Overview

• MIT's new algorithm merges the speed of Regev's method with the memory efficiency of Shor's algorithm.
• The development could help create encryption methods resistant to quantum code-breaking.
• Current quantum computers lack the capacity to run Shor's algorithm, which requires around 20 million qubits.
• The proposed algorithm is more tolerant to quantum noise, enhancing its practical implementation.
• Future work aims to further refine the algorithm and test it on actual quantum circuits.