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.
2017
2017
We present some basic integer arithmetic quantum circuits, such as adders and multipliers-accumulators of various forms, as well… 
2015
2015
Ongoing work in quantum information emphasises the need for a structural understanding of quantum speedups: in this work, we… 
2014
2014
Based on the one- and two-qubit gates defined and generated via superconducting transmon qubits homogeneously coupled to a… 
Highly Cited
2012
Highly Cited
2012
With the wide applications of saliency information in visual signal processing, many saliency detection methods have been… 
2011
2011
A new robust adaptive control method is proposed, which removes the deficiencies of the classic robust multiple model adaptive… 
2007
2007
This note introduces Fourier transforms over finite Abelian groups, and shows how this can be used to find the period of any… 
2007
2007
We show how to construct an efficient quantum circuit for computing a good approximation of the quantum Fourier transform on a… 
Highly Cited
2002
Highly Cited
2002
We present a scheme for the implementation of the discrete quantum Fourier transform using cavity quantum electrodynamics. In the… 
Highly Cited
1994
Highly Cited
1994
Active magnetic bearing (AMB) actuators support rotors without friction but require feedback control for stabilization and…