Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Quantum Fourier transform

Known as: QFT, Quantum fourier transforms 
In quantum computing, the quantum Fourier transform is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The quantum Fourier transform, with exponential speed-up compared to the classical fast Fourier transform, has played an… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
We investigate the quantum watermark strategy for quantum images based on quantum Fourier transform proposed by Zhang et al… Expand
Is this relevant?
Highly Cited
2013
Highly Cited
2013
We present a robust watermark strategy for quantum images. The watermark image is embedded into the fourier coefficients of the… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We formalise the constructive content of an essential feature of quantum mechanics: the interaction of complementary quantum… Expand
Is this relevant?
2007
2007
A number of elegant approaches have been developed for the identification of quantum circuits which can be efficiently simulated… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We construct a black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We give an algorithm for approximating the quantum Fourier transform over an arbitrary Z/sub p/ which requires only O(n log n… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
  • R. Cleve, J. Watrous
  • Proceedings 41st Annual Symposium on Foundations…
  • 2000
  • Corpus ID: 1967204
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of O(log n+log log(1… Expand
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • A. Kitaev
  • Electron. Colloquium Comput. Complex.
  • 1996
  • Corpus ID: 17023060
We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete… Expand
Is this relevant?