Oversimplifying quantum factoring

Building a device capable of factoring large numbers is a major goal of quantum computing; an algorithm for quantum factoring (Shor’s algorithm) exists, and a simple coin-tossing exercise is used to illustrate the dangers of oversimplification when implementing this algorithm experimentally.