Quantum Discrete Fourier Transform with Classical Output for Signal Processing

Details Quantum Discrete Fourier Transform with Classical Output for Signal Processing Quantum Discrete Fourier Transform with Classical Output for Signal Processing

2007-06-17

arxiv.org/abs/0706.2451v1

Physics

Quantum Physics

11 pages, 1 figure

Scientific paper

Discrete Fourier transform (DFT) is the base of modern signal or information processing. 1-Dimensional fast Fourier transform (1D FFT) and 2D FFT have time complexity O(NlogN) and O(N^2logN) respectively. Quantum 1D and 2D DFT algorithms with classical output (1D QDFT and 2D QDFT) are presented in this paper. And quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, QDFT has two advantages at least. One of advantages is that 1D and 2D QDFT has time complexity O(sqrt(N)) and O(N) respectively. The other advantage is that QDFT can process very long signal sequence at a time. QDFT and quantum convolution demonstrate that quantum signal processing with classical output is possible.

Affiliated with

Also associated with

No associations

Rating

Quantum Discrete Fourier Transform with Classical Output for Signal Processing 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 Quantum Discrete Fourier Transform with Classical Output for Signal Processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Discrete Fourier Transform with Classical Output for Signal Processing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-332225