Related papers: Quadratic discrete Fourier transform and mutually …
The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…
The Discrete Fourier Transform (DFT) is central to the analysis of uniformly sampled signals, yet many practical applications involve non-uniform sampling, requiring the Non-Uniform Discrete Fourier Transform (NUDFT). While quantum…
The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two…
The one-dimensional (1D) fractional Fourier transform (FRFT) generalizes the Fourier transform, offering significant advantages in the time-frequency analysis of non-stationary signals. While various 2D extensions exist, such as the 2D…
We treat the quaternionic Fourier transform (QFT) applied to quaternion fields and investigate QFT properties useful for applications. Different forms of the QFT lead us to different Plancherel theorems. We relate the QFT computation for…
The quaternion Fourier transform (QFT) satisfies some uncertainty principles similar to the Euclidean Fourier transform. In this paper, we establish Miyachi's theorem for this transform.
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…
We present a general methodology to obtain the basis of qudits which are admissible to Quantum Fourier Transform (QFT). We first study this method for qubits to characterize the ensemble that works for the Hadamard transformation (QFT for…
The existence problem for mutually unbiased bases is an unsolved problem in quantum information theory. A related question is whether every pair of bases admits vectors that are unbiased to both. Mathematically this translates to the…
The Fractional Fourier Transform (FrFT) has widespread applications in areas like signal analysis, Fourier optics, diffraction theory, etc. The Holomorphic Fractional Fourier Transform (HFrFT) proposed in the present paper may be used in…
We provide a brief overview of what is known about Quadratic Gravity, which includes terms quadratic in the curvatures in the fundamental action. This is proposed as a renormalizeable UV completion for quantum gravity which continues to use…
The Hilbert transform is a multiplier operator and is widely used in the theory of Fourier transforms. The Hilbert transform was the motivation for the development of modern harmonic analysis. Its discrete version is also widely used in…
We report experimental implementation of discrete Fourier transformation(DFT) on a nuclear magnetic resonance(NMR) quantum computer. Experimental results agree with theoretical results. Using the pulse sequences we introduced, DFT can be…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
From a suitable integral representation of the Laplace transform of a positive semi-definite quadratic form of independent real random variables with not necessarily identical densities a univariate integral representation is derived for…
These are notes of a talk based on the work arXiv:1212.3630 joint with A. Aizenbud. Let V be a finite-dimensional vector space over a local field F of characteristic 0. Let f be a function on V of the form $f(x)= \psi (P(x))$, where P is a…
We study a quantum computer with fixed and permanent interaction of diagonal type between qubits. It is controlled only by one-qubit quick transformations. It is shown how to implement Quantum Fourier Transform and to solve Shroedinger…
We study the robustness of various protocols for quantum key distribution. We first consider the case of qutrits and study quantum protocols that employ two and three mutually unbiased bases. We then derive the optimal eavesdropping…
We describe a setup for obtaining uncertainty relations for arbitrary pairs of observables related by Fourier transform. The physical examples discussed here are standard position and momentum, number and angle, finite qudit systems, and…
In this paper we show that the discrete Fourier transform can be performed by scattering a coherent particle or laser beam off a two-dimensional potential that has the shape of rings or peaks. After encoding the initial vector into the…