Generic Quantum Fourier Transforms

Details Generic Quantum Fourier Transforms Generic Quantum Fourier Transforms

2003-04-09

arxiv.org/abs/quant-ph/0304064v1

Physics

Quantum Physics

Scientific paper

The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the separation of variables technique that has been so successful in the study of classical Fourier transform computations. Specifically, this framework applies the existence of computable Bratteli diagrams, adapted factorizations, and Gel'fand-Tsetlin bases to offer efficient quantum circuits for the QFT over a wide variety a finite Abelian and non-Abelian groups, including all group families for which efficient QFTs are currently known and many new group families. Moreover, the method gives rise to the first subexponential-size quantum circuits for the QFT over the linear groups GL_k(q), SL_k(q), and the finite groups of Lie type, for any fixed prime power q.

Affiliated with

Also associated with

No associations

Rating

Generic Quantum Fourier Transforms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generic Quantum Fourier Transforms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generic Quantum Fourier Transforms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-559512