[$] A more efficient implementation of Shor's algorithm

Shor's algorithm is the main practical example of an algorithm that runs morequickly on a quantum computer than a classical computer - at least in theory.Shor's algorithm allows large numbers to be factoredinto their component prime factors quickly.In reality, existing quantum computers do not have nearlyenough memory to factor interesting numbers using Shor's algorithm, despitedecades of research.A new paper provides a major stepin that direction, however. While still impractical on today's quantumcomputers, the recent discoverycuts the amount of memory needed to attack 256-bit elliptic-curve cryptographyby a factor of 20. More interesting, however, is that the researchers chose topublish a zero-knowledge proof demonstrating that they know a quantum circuitthat shows these improvements, rather than publishing the actualknowledge of how to do it.