Efficient classical simulation of the semi-classical Quantum Fourier Transform

A number of elegant approaches have been developed for the identification of quantum circuits which can be efficiently simulated on a classical computer. Recently, these methods have been employed to demonstrate the classical simulability of the quantum Fourier transform (QFT). In this note, we show that one can demonstrate a number of simulability results for QFT circuits in a straightforward manner using Griffiths and Niu's semi-classical QFT construction [Phys. Rev. Lett. 76, 3228 (1996)]. We then discuss the consequences of these results in the context of Shor's factorisation algorithm