Related papers: An integral transform for quantum amplitudes

Matrix coordinate transformations are defined as substitution operators without requiring an ordering prescription or an inclusion function from the Abelian coordinate transformations. We construct transforming objects mimicking most of the…

The Arithmetic Fourier Transform is a numerical formulation for computing Fourier series and Taylor series coefficients. It competes with the Fast Fourier Transform in terms of speed and efficiency, requiring only addition operations and…

Harmonic inversion is introduced as a powerful tool for both the analysis of quantum spectra and semiclassical periodic orbit quantization. The method allows to circumvent the uncertainty principle of the conventional Fourier transform and…

An explicit formula is derived for the Fourier transform of a Gaussian measure on the Heisenberg group at the Schrodinger representation. Using this explicit formula, necessary and sufficient conditions are given for the convolution of two…

We introduce a class of integral theorems based on cyclic functions and Riemann sums approximating integrals. The Fourier integral theorem, derived as a combination of a transform and inverse transform, arises as a special case. The…

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,…

This paper proposes a class of power-of-two FFT (Fast Fourier Transform) algorithms, called AM-QFT algorithms, that contains the improved QFT (Quick Fourier Transform), an algorithm recently published, as a special case. The main idea is to…

We formulate a notion of group Fourier transform for a finite dimensional Lie group. The transform provides a unitary map from square integrable functions on the group to square integrable functions on a non-commutative dual space. We then…

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),…

For each $f\!:\!\mathbb{R}\to\mathbb{C}$ that is Henstock--Kurzweil integrable on the real line, or is a distribution in the completion of the space of Henstock--Kurzweil integrable functions in the Alexiewicz norm, it is shown that the…

An analytical result is given for the exact evaluation of an integral which arises in the analysis of acoustic radiation from wave packet sources: $ I_{mn}(\beta,q) = \int_{-\infty}^{\infty} e^{-\beta^{2}x^{2}-i q x}x^{m+1/2}J_{n+1/2}(x)…

We provide numerical evidence that the quantum Fourier transform can be efficiently represented in a matrix product operator with a size growing relatively slowly with the number of qubits. Additionally, we numerically show that the tensors…

For each of the eight $n$-th derivative parameter changing formulas for Gauss hypergeometric functions a corresponding fractional integration formula is given. For both types of formulas the differential or integral operator is intertwining…

The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…

Miller-Paris transformations are extensions of Euler's transformations for the Gauss hypergeometric functions to generalized hypergeometric functions of higher-order having integral parameter differences (IPD). In our recent work we…

Fractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration and complex numbers. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has…

Fourier expansion of the integrand in the path integral formula for the partition function of quantum systems leads to a deterministic expression which, though still quite complex, is easier to process than the original functional integral.…

Due to the linearity of quantum operations, it is not straightforward to implement nonlinear transformations on a quantum computer, making some practical tasks like a neural network hard to be achieved. In this work, we define a task called…

A discrete Laplace transform and its inversion formula are obtained by using a quadrature of the continuous Fourier transform which is given in terms of Hermite polynomials and its zeros. This approach yields a convergent discrete formula…

We construct a Moutard-type transform for the generalized analytic functions. The first theorems and the first explicit examples in this connection are given.