A quantum Fourier transform algorithm

Simple item page
dc.creatorLomont, Chris
dc.date2004-04-09
dc.date2004-06-17
dc.date.accessioned2026-07-07T06:09:31Z
dc.date.available2026-07-07T06:09:31Z
dc.descriptionAlgorithms 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.
dc.description18 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
dc.identifierhttps://arxiv.org/abs/quant-ph/0404060
dc.identifierhttp://arxiv.org/abs/quant-ph/0404060
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91988
dc.subjectQuantum Physics
dc.subjectData Structures and Algorithms
dc.titleA quantum Fourier transform algorithm
dc.typetext

Files

Collections

arXiv