Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We introduce a set of quantum adiabatic evolutions that we argue may be used as `building blocks', or subroutines, in the… 
2013
2013
A new digital robust control law for dc–dc converters is analyzed and implemented in this paper. The robust control QFT technique… 
2012
2012
Abstract This paper proposes an optimization algorithm for the automatic design of robust PID controllers using Quantitative… 
2010
2010
Considering both the parameter uncertainty of mathematical model of BTT(bank-to-turn) missile and the strong coupling influence… 
2007
2007
This note introduces Fourier transforms over finite Abelian groups, and shows how this can be used to find the period of any… 
2004
2004
Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper… 
2003
2003
We propose a general geometry representation of d-level quantum system (or qudit for short). Then we define a general class of… 
2002
2002
Quantum algorithm dynamics of quantum computation states are analyzed from classical and quantum information theory standpoint… 
2002
2002
  • Z. ZilicK. Radecka
  • 2002
  • Corpus ID: 15414401
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the…