Related papers: An integral transform for quantum amplitudes
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…
Integral transformations of the QCD invariant (running) coupling and of some related objects are discussed. Special attention is paid to the Fourier transformation, that is to transition from the space-time to the energy--momentum…
We highlight the important role of the Fourier transform in deriving inversion formulas for the integral transforms of tomographic imaging. We demonstrate this principle by deriving inversion formulas for the divergent beam transform and…
A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list…
In relativistic quantum constraint mechanics the state of a physical system is constrained to a 3-dimensional subspace of Minkowski 4-space. Fourier transformation can be used to relate this state between constraint spaces in 4-position and…
There are quantum procedures that encode the solutions to a problem in the phases of quantum amplitudes. This happens in some quantum optimization algorithms in which the value of a function to be maximized or minimized is represented by a…
The Fourier transform, known in classical analysis, and generalized in abstract harmonic analysis, can also be considered in the theory of locally compact quantum groups. In this note, I discuss some aspects of this more general Fourier…
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…
This paper describes a method of calculating the transforms, currently obtained via Fourier and reverse Fourier transforms. The method allows calculating efficiently the transforms of a signal having an arbitrary dimension of the digital…
We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a…
Standard numerical integrators suffer from an order reduction when applied to nonlinear Schr\"{o}dinger equations with low-regularity initial data. For example, standard Strang splitting requires the boundedness of the solution in $H^{r+4}$…
A gauge-invariant Wigner quantum mechanical theory is obtained by applying the Weyl-Stratonovich transform to the von Neumann equation for the density matrix. The transform reduces to the Weyl transform in the electrostatic limit, when the…
We study very smooth functions on the real line, namely Schwartz functions, that satisfy a finite identity relating their translates and a single modulation. Concretely, we assume there is a nontrivial linear combination of translates of…
The predictions of the standard model of particle physics are highly successful in spite of the fact that several parts of the underlying quantum field theoretical framework are analytically problematic. Indeed, it has long been suggested,…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
We implement an efficient method of computation of two dimensional Fourier-type integrals based on approximation of the integrand by Gaussian radial basis functions, which constitute a standard tool in approximation theory. As a result, we…
This paper introduces quantum circuit methodologies for pointwise multiplication and convolution of complex functions, conceptualized as "processing through encoding". Leveraging known techniques, we describe an approach where multiple…
The Fourier transform is typically seen as closely related to the additive group of real numbers, its characters and its Haar measure. In this paper, we propose an alternative viewpoint; the Fourier transform can be uniquely characterized…