Related papers: On the diagonalization of the discrete Fourier tra…
Two methods for fast Fourier transforms are used in a quantum context. The first method is for systems with dimension of the Hilbert space $D=d^n$ with $d$ an odd integer, and is inspired by the Cooley-Tukey formalism. The `large Fourier…
The nonlinear Fourier transform (NFT), a powerful tool in soliton theory and exactly solvable models, is a method for solving integrable partial differential equations governing wave propagation in certain nonlinear media. The NFT…
Foundation models have achieved tremendous success in different domains. However, their huge computation and storage complexity make these models difficult to fine-tune and also less applicable in practice. Recent study shows training in…
The paper deals with a fractional derivative introduced by means of the Fourier transform. The explicit form of the kernel of general derivative operator acting on the functions analytic on a curve in complex plane is deduced and the…
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of…
We discuss efficient algorithms for the accurate forward and reverse evaluation of the discrete Fourier-Bessel transform (dFBT) as numerical tools to assist in the 2D polar convolution of two radially symmetric functions, relevant, e.g., to…
Based on the discrete fractional random transform (DFRNT), we present the discrete fractional random cosine and sine transforms (DFRNCT and DFRNST). We demonstrate that the DFRNCT and DFRNST can be regarded as special kinds of DFRNT and…
Signal scaling is a fundamental operation of practical importance in which a signal is enlarged or shrunk in the coordinate direction(s). Scaling or magnification is not trivial for signals of a discrete variable since the signal values may…
The Fast Fourier Transform (FFT) is a numerical operation that transforms a function into a form comprised of its constituent frequencies and is an integral part of scientific computation and data analysis. The objective of our work is to…
The Hamiltonian of the harmonic oscillator is usually defined as a differential operator, but an integral representation can be obtained by using the coherent state quantization. The finite frame quantization is a finite counterpart of the…
The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…
Bandlimiting and timelimiting operators play a fundamental role in analyzing bandlimited signals that are approximately timelimited (or vice versa). In this paper, we consider a time-frequency (in the discrete Fourier transform (DFT)…
A complete set of d+1 mutually unbiased bases exists in a Hilbert spaces of dimension d, whenever d is a power of a prime. We discuss a simple construction of d+1 disjoint classes (each one having d-1 commuting operators) such that the…
We solve the problem of Fourier transformation for the one-dimensional $q$-deformed Heisenberg algebra. Starting from a matrix representation of this algebra we observe that momentum and position are unbounded operators in the Hilbert…
This work is devoted to computing the centralizer $Z (L)$ of an ordinary differential operator (ODO) in the ring of differential operators. Non-trivial centralizers are known to be coordinate rings of spectral curves and contain the ring of…
We investigate the application of windowed Fourier frames (WFFs) to the numerical solution of partial differential equations, focussing on elliptic equations. The action of a partial differential operator (PDO) on a windowed plane wave is…
We use the well-known observation that the solutions of Jacobi's differential equation can be represented via non-oscillatory phase and amplitude functions to develop a fast algorithm for computing multi-dimensional Jacobi polynomial…
In many processes, the variations in underlying characteristics can be approximated by noisy multi-periodic patterns. If large-scale patterns are superimposed by a noise with long-range correlations, the detection of multi-periodic patterns…
We study fractional differential equations of Riemann-Liouville and Caputo type in Hilbert spaces. Using exponentially weighted spaces of functions defined on $\mathbb{R}$, we define fractional operators by means of a functional calculus…
We propose an implementation of the algorithm for the fast Fourier transform (FFT) as a quantum circuit consisting of a combination of some quantum gates. In our implementation, a data sequence is expressed by a tensor product of vector…