Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Chinese Science Bulletin

Realization of quantum discrete Fourier transform with NMR

Ximing Fang, Xiwen Zhu, Mang Feng, Xi‐an Mao, Fei Du

Published Jun 1, 2000• 8 citations
Publisher
DOI
10.1007/bf02887176

Related papers

Experimental realization of discrete fourier transformation on NMR quantum computers

Li‐Yun Fu, J. Luo, Xiao Li +1 more

arXiv:quant-ph/9905083•Applied Magnetic Resonance•Jun 1, 2000•16 citations

Quantum information processing by NMR

T. S. Mahesh

Resonance•Nov 1, 2015•2 citations

A quantum search algorithm of two entangled registers to realize quantum discrete Fourier transform of signal processing

Chao-Yang Pang, Ben-Qiong Hu

The discrete Fourier transform (DFT) is the base of modern signal processing. 1-dimensional fast Fourier transform (ID FFT) and 2D FFT have time complexity O ( N log N ) and O ( N 2 log N ) respectively. Since 1965, there has been no more essential breakthrough for the design of fast DFT algorithm. DFT has two properties. One property is that DFT is energy conservation transform. The other property is that many DFT coefficients are close to zero. The basic idea of this paper is that the generalized Grover's iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy. One-dimensional quantum DFT (ID QDFT) and two-dimensional quantum DFT (2D QDFT) are presented in this paper. The quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, ID and 2D QDFT have time complexity O(√ N ) and O ( N ) respectively. QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible.

Chinese Physics B•Sep 1, 2008•7 citations

Implementing Quantum Discrete Fourier Transform by Using Cavity Quantum Electrodynamics

Hong‐Fu Wang, Shou Zhang, Kyu-Hwang Yeon

Journal of the Korean Physical Society•Oct 15, 2008•21 citations

Quantum Computation with NMR

Jonathan A. Jones

WORLD SCIENTIFIC eBooks•Jan 1, 2001•2 citations

Large quantum Fourier transforms are never exactly realized by braiding conformal blocks

Michael Hartley Freedman, Zhenghan Wang

Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set {$\mathbb{U}(2)$, controlled-NOT}, the discrete Fourier transforms ${F}_{N}={({\ensuremath{\omega}}^{ij})}_{N\ifmmode\times\else\texttimes\fi{}N}$, $i,j=0,1,\dots{},N\ensuremath{-}1$, $\ensuremath{\omega}={e}^{2\ensuremath{\pi}i∕N}$, can be realized exactly by quantum circuits of size $O({n}^{2})$, $n=\mathrm{ln}\phantom{\rule{0.2em}{0ex}}N$, and so can the discrete sine or cosine transforms. In topological quantum computing, the simplest universal topological quantum computer is based on the Fibonacci $(2+1)$-topological quantum field theory (TQFT), where the standard quantum circuits are replaced by unitary transformations realized by braiding conformal blocks. We report here that the large Fourier transforms ${F}_{N}$ and the discrete sine or cosine transforms can never be realized exactly by braiding conformal blocks for a fixed TQFT. It follows that an approximation is unavoidable in the implementation of Fourier transforms by braiding conformal blocks.

arXiv:cond-mat/0609411•Physical Review A•Mar 15, 2007•60 citations
The discrete Fourier transform (DFT) is the base of modern signal processing. 1-dimensional fast Fourier transform (ID FFT) and 2D FFT have time complexity O ( N log N ) and O ( N 2 log N ) respectively. Since 1965, there has been no more essential breakthrough for the design of fast DFT algorithm. DFT has two properties. One property is that DFT is energy conservation transform. The other property is that many DFT coefficients are close to zero. The basic idea of this paper is that the generalized Grover's iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy. One-dimensional quantum DFT (ID QDFT) and two-dimensional quantum DFT (2D QDFT) are presented in this paper. The quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, ID and 2D QDFT have time complexity O(√ N ) and O ( N ) respectively. QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible.
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set {U(2)\mathbb{U}(2)U(2), controlled-NOT}, the discrete Fourier transforms ${F}_{N}={({\ensuremath{\omega}}^{ij})}_{N\ifmmode\times\else\texttimes\fi{}N}$, $i,j=0,1,\dots{},N\ensuremath{-}1$, $\ensuremath{\omega}={e}^{2\ensuremath{\pi}i∕N}$, can be realized exactly by quantum circuits of size O(n2)O({n}^{2})O(n2), n=lnNn=\mathrm{ln}\phantom{\rule{0.2em}{0ex}}Nn=lnN, and so can the discrete sine or cosine transforms. In topological quantum computing, the simplest universal topological quantum computer is based on the Fibonacci (2+1)(2+1)(2+1)-topological quantum field theory (TQFT), where the standard quantum circuits are replaced by unitary transformations realized by braiding conformal blocks. We report here that the large Fourier transforms FN{F}_{N}FN​ and the discrete sine or cosine transforms can never be realized exactly by braiding conformal blocks for a fixed TQFT. It follows that an approximation is unavoidable in the implementation of Fourier transforms by braiding conformal blocks.