Efficient Quantum Fourier Transforms For Semisimple AlgebrasResearch Paper
The quantum Fourier transform (QFT) of a finite group is the change of basis on that block-diagonalizes the regular representation. For cyclic groups it is the engine of Shor's period finding, and efficient circuits are known for several non-abelian groups, starting with Beals' QFT for the symmetric group (Beals 1997) and the…