Related papers: Fourier transformation and response functions
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…
We propose an effective field theory (EFT) of fractional quantum Hall systems near the filling fraction $\nu=5/2$ that flows to pertinent IR candidate phases, including non-abelian Pfaffian, anti-Pfaffian, and particle-hole Pfaffian states…
We present a general approach for evaluating a large variety of three-dimensional Fourier transforms. The transforms considered include the useful cases of the Coulomb and dipole potentials, and include situations where the transforms are…
The problem of computing the Fourier Transform of a signal whose spectrum is dominated by a small number $k$ of frequencies quickly and using a small number of samples of the signal in time domain (the Sparse FFT problem) has received…
Fourier and fractional-Fourier transformations are widely used in theoretical physics. In this paper we make quantum perspectives and generalization for the fractional Fourier transformation (FrFT). By virtue of quantum mechanical…
The use of Fourier methods in wave-front reconstruction can significantly reduce the computation time for large telescopes with a high number of degrees of freedom. However, Fourier algorithms for discrete data require a rectangular data…
In this paper we prove pointwise and distributional Fourier transform inversion theorems for functions on the real line that are locally of bounded variation, while in a neighbourhood of infinity are Lebesgue integrable or have polynomial…
We consider a general one-particle Hamiltonian H = - \Delta_r + u(r) defined in a d-dimensional domain. The object of interest is the time-independent Green function G_z(r,r') = < r | (z-H)^{-1} | r' >. Recently, in one dimension (1D), the…
Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…
The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\log n)$.…
In this article, we develop comprehensive frequency domain methods for estimating and inferring the second-order structure of spatial point processes. The main element here is on utilizing the discrete Fourier transform (DFT) of the point…
We compute the second moment of the Riemann zeta function for shifted arguments over a domain that extends the ones in the literature. We use the Riemann-Siegel formula for the error term in the approximate functional equation and take the…
The solution of the sine-Gordon equation in the quarter plane can be expressed in terms of the solution of a matrix Riemann-Hilbert problem whose definition involves four spectral functions $a,b,A,B$. The functions $a(k)$ and $b(k)$ are…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
We consider the free space Helmholtz Green's function and split it into the sum of oscillatory and non-oscillatory (singular) components. The goal is to separate the impact of the singularity of the real part at the origin from the…
Fourier transform is applied to annular beams of simplified flat two-level geometry: bright outer ring with a darker core. The pattern of focal beam profile (i.e. far field) is calculated and characterized with respect of its intensity…
The scattering of electromagnetic pulses is described using a non-singular boundary integral method to solve directly for the field components in the frequency domain, and Fourier transform is then used to obtain the complete space-time…
- 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…
The Fractional Fourier Transform (FRT) corresponds to an arbitrary-angle rotation in the phase space, e.g. the time-frequency (TF) space, and generalizes the fundamentally important Fourier Transform. FRT applications range from classical…
We show that the Green's function of a two dimensional fermion with a modified dispersion relation and short distance parameter $a$ is given by the Lerch zeta function. The Green's function is defined on a cylinder of radius R and we show…