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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

: In this paper, the digital quantum coprocessor has been checked for the possibility of quantum Fourier transform, which is the…

2014

We introduce a set of quantum adiabatic evolutions that we argue may be used as `building blocks', or subroutines, in the…

2012

2012

Abstract This paper proposes an optimization algorithm for the automatic design of robust PID controllers using Quantitative…

2012

This paper presents the multivalued logic version of the quantum pseudo-fractional Fourier transform (QFrFT), which is a more…

2011

A new robust adaptive control method is proposed, which removes the deficiencies of the classic robust multiple model adaptive…

2007

This note introduces Fourier transforms over finite Abelian groups, and shows how this can be used to find the period of any…

2005

The publication of the quadratic Frobenius primality test [6] has stimulated a lot of research, see e.g. [4, 10, 11]. In this…

2004

Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper…

2003

We propose a general geometry representation of d-level quantum system (or qudit for short). Then we define a general class of…