We show that the quantum Fourier transform on finite fields used to solve query problems is a special case of the usual quantum Fourier transform on finite abelian groups. We show that the control/target inversion property holds in general. We apply this to get a sharp query complexity separation between classical and quantum algorithms for a hidden homomorphism problem on finite abelian groups.

This paper will explore the heuristic principle that a function on the line and its Fourier transform cannot both be concentrated on small sets. We begin with the basic properties of the Fourier transform and show that a function and its Fourier transform cannot both have compact support. From there we prove the Fourier inversion theorem and use this to prove the classical uncertainty principle...

A new family of error-correcting codes, called Fourier codes, is introduced. The code parity-check matrix, dimension and an upper bound on its minimum distance are obtained from the eigenstructure of the Fourier number theoretic transform. A decoding technique for such codes is proposed. Index Terms – finite field Fourier transform, number theoretic transform, eigensequences, linear block codes.

The fractional Fourier transform is a time–frequency distribution and an extension of the classical Fourier transform. There are several known applications of the fractional Fourier transform in the areas of signal processing, especially in signal restoration and noise removal. This paper provides an introduction to the fractional Fourier transform and its applications. These applications deman...

We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its Fourier transform to the problems of computing Fourier transforms on its maximal subgroups and a fast zeta transform on its poset structure. We then exhibit exp...

We give a discussion of harmonic analysis on finite abelian groups, emphasizing various ways in which the structure of the group is encoded on various spaces of functions, ways in which the Fourier transform detects and preserves these structures. We discuss the major tools, like convolutions and Fourier transforms, along with some fundamental theorems, like the Plancheral, Parseval, Fourier in...

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

Motivated by problems in signal recovery, we will investigate the distribution of the energy of the Fourier transform of a positive function on a finite group. In particular, we are able to bound from below the fraction of energy contained in various subsets of the Fourier transform of a positive function defined on a finite group. Applications to signal recovery for positive functions, as well...