Quantum Computing, Quantum Algorithms.
of quantum Fourier transform (QFT). The latter implying that Shor’s is the worst-case so far in terms of need for very fine granularity of phase. As noted earlier, a quantum Fourier transform would have unitary matrix entries of the form: exp (two pi i j k over 2^n) For a strong encryption key, n