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… (More)
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… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Review
2017
Review
2017
The quantum Fourier transform offers an interesting way to perform arithmetic operations on a quantum computer. We review… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
This paper proposes an <i>O</i>(<i>n</i><sup>4</sup>) quantum Fourier transform (QFT) algorithm over symmetric group <i>S<sub>n… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime… (More)
  • figure 1
Is this relevant?
2011
2011
The Quantum Fourier Transform (QFT) has an important role in some of the most interesting and useful quantum algorithms, such as… (More)
  • figure 1
  • figure 4
  • figure 3
  • table I
  • figure 6
Is this relevant?
2004
2004
The quantum Fourier transform (QFT) is the principal ingredient of most efficient quantum algorithms. We present a generic… (More)
  • figure 1
Is this relevant?
2004
2004
We analyze a class of quantum operations based on a geometrical representation of d−level quantum system (or qudit for short). A… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of O(logn + log log(1… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This book provides a thorough introduction to quantum information theory and quantum computation in general, especially covering… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We give an algorithm for approximating the quantum Fourier transform over an arbitraryZp which requires only O(n logn) steps… (More)
Is this relevant?