A short note on Shor's factoring algorithm

This note shows that Shor's algorithm for factoring in polynomial time on a quantum computer can be made to work with zero error probability.