Related papers: Fast Fourier Transforms for the Rook Monoid
Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…
In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform…
- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
In the first part of the paper kernels are constructed which meromorphically extend the Macdonald-Koornwinder polynomials in their degrees. In the second part of the paper the kernels associated with rank one root systems are used to define…
Starting from square-integrable wave functions on a Lie group, we build an invertible Fourier transform mapping them on wave functions on the dual of the Lie algebra. This is a group-theoretic version of the map from position space to…
The quadratic phase Fourier transform QPFT is a neoteric addition to the class of Fourier transforms and embodies a variety of signal processing tools including the Fourier, fractional Fourier, linear canonical, and special affine Fourier…
This comprehensive review paper delves into the intricacies of advanced Fourier type integral transforms and their mathematical properties, with a particular focus on fractional Fourier transform (FrFT), linear canonical transform (LCT),…
In this paper, a new fast and low complexity transform is introduced for orthogonal frequency division multiplexing (OFDM) wireless systems. The new transform combines the effects of fast complex-Walsh-Hadamard transform (CHT) and the fast…
Based on the definition of the Fourier transform in terms of the number operator of the quantum harmonic oscillator and in the corresponding definition of the fractional Fourier transform, we have obtained the discrete fractional Fourier…
Galois rings are regarded as "building blocks" of a finite commutative ring with identity. There have been many papers on classical error correction codes over Galois rings published. As an important warm-up before exploring quantum…
It will be shown how to map a simple one-dimensional tight binding model with a cosine potential in one dimension exactly to a two dimensional tight binding model with periodic boundary conditions with the presence of a single flux quantum…
Quantum Fourier transformation is important in many quantum algorithms. In this paper, we generalize quantum Fourier transformation over the Abelian group $\mathbb{Z}_N$ from two different points to get more efficient unitary…
The nonuniform fast Fourier transform (NUFFT) generalizes the FFT to off-grid data. Its many applications include image reconstruction, data analysis, and the numerical solution of differential equations. We present FINUFFT, an efficient…
We present an efficient, fast and robust Nonlinear Fourier Transform (NFT) algorithm to detect eigenvalues of the discrete spectrum. It outperforms other known NFT algorithms as it detects the eigenvalues from the continuous spectrum, the…
The Number Theoretic Transform (NTT) can be regarded as a variant of the Discrete Fourier Transform. NTT has been quite a powerful mathematical tool in developing Post-Quantum Cryptography and Homomorphic Encryption. The Fourier Transform…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1,…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
Understanding the flow of complex media is relevant for a wide range of research fields and industrial applications. Several numerical approaches exist by which approximate solutions can be determined for the Stokes equations that describe…
A brief survey of the theory of soliton perturbations is presented. The focus is on the usefulness of the so-called Generalised Fourier Transform (GFT). This is a method that involves expansions over the complete basis of `squared olutions`…