Quantum Computing.
integer j represented in the first l qbits and the integer r represented in the last l qbits are such that ƒ(j) = r. — Quantum Fourier Transform — If o is a divisor of L the number of computational states in this superposition is exactly L/o otherwise it is the largest integer less than that. In