A quantum Fourier transform algorithm
Quantum Physics
2007-05-23 v2 Data Structures and Algorithms
Abstract
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.
Cite
@article{arxiv.quant-ph/0404060,
title = {A quantum Fourier transform algorithm},
author = {Chris Lomont},
journal= {arXiv preprint arXiv:quant-ph/0404060},
year = {2007}
}
Comments
18 pages. Minor corrections were made, and some new material was added. Particularly, simulation results were added to show output of the algorithm, and to suggest possible improvements