A quantum Fourier transform algorithm
<|reference_start|>A quantum Fourier transform algorithm: Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds given earlier. Exact bounds are given for the number of qubits needed to achieve a desired tolerance, allowing simulation of the algorithm.<|reference_end|>
@article{lomont2004a,
    title={A quantum Fourier transform algorithm},
    author={Chris Lomont},
    journal={arXiv preprint arXiv:quant-ph/0404060},
    year={2004},
    archivePrefix={arXiv},
    eprint={quant-ph/0404060},
    primaryClass={quant-ph cs.DS}
}