Related papers: Quadratic discrete Fourier transform and mutually …

In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a…

This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a…

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…

We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…

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

We give an entirely new approach to the problem of mutually unbiased bases (MUBs), based on a Fourier analytic technique in additive combinatorics. The method provides a short and elegant generalization of the fact that there are at most…

Discrete Fourier transform (DFT) is the base of modern signal or information processing. 1-Dimensional fast Fourier transform (1D FFT) and 2D FFT have time complexity O(NlogN) and O(N^2logN) respectively. Quantum 1D and 2D DFT algorithms…

This paper presents a new approach for tackling the shift-invariance problem in the discrete Haar domain, without trading off any of its desirable properties, such as compression, separability, orthogonality, and symmetry. The paper…

We present an experimental study of higher-dimensional quantum key distribution protocols based on mutually unbiased bases, implemented by means of photons carrying orbital angular momentum. We perform (d+1) mutually unbiased measurements…

We derive an uncertainty relation for two unitary operators which obey a commutation relation of the form UV=exp[i phi] VU. Its most important application is to constrain how much a quantum state can be localised simultaneously in two…

We analyse in detail the quantization of a simple noncommutative model of spontaneous symmetry breaking in zero dimensions taking into account the noncommutative setting seriously. The connection to the counting argument of Feyman diagrams…

Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic…

The offset linear canonical transform encompassing the numerous integral transforms, is a promising tool for analyzing non-stationary signals with more degrees of freedom. In this paper, we generalize the windowed offset linear canonical…

The explicit construction of direct and inverse Fourier's vector transform with discontinuous coefficients is presented. The technique of applying Fourier's vector transform with discontinuous coefficients for solving problems of…

The Fourier transformation is an effective and efficient operation of Gaussianization at the one-point level. Using a set of N-body simulation data, we verified that the one-point distribution functions of the dark matter momentum…

We apply the stationary phase method developed in (Assier, Shanin \& Korolkov, QJMAM, 76(1), 2022) to the problem of wave diffraction by a quarter-plane. The wave field is written as a double Fourier transform of an unknown spectral…

The large variety of Fourier transforms in geometric algebras inspired the straight forward definition of ``A General Geometric Fourier Transform`` in Bujack et al., Proc. of ICCA9, covering most versions in the literature. We showed which…

Computing accurate estimates of the Fourier transform of analog signals from discrete data points is important in many fields of science and engineering. The conventional approach of performing the discrete Fourier transform of the data…

Fourier transformations of several functions of one and two variables are evaluated and then used to derive some integral and series identities. It is shown that certain double Mordell integrals can be reduced to a sum of products of…

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…