Related papers: Fast complexified quaternion Fourier transform
Very recently the most general ensemble of qubits are identified using the notion of linearity; any of these qubits gets accepted by a Hadamard gate to generate the equal superposition of the qubit and its orthogonal. Towards more…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
In this paper we propose a novel transform called continuous quaternionic stockwell transform. We express the admissibility condition in term of the (two-sided) quaternion Fourier transform . We show that its fundamental properties, such as…
We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves…
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…
Multirate digital signal processing and model reduction applications require computation of the frequency truncated norm of a discrete-time system. This paper explains how to compute the frequency truncated norm of a discrete-time system.…
In this note, we study the convergence from the discrete to the continuous non-linear Fourier transform. Relations between spectral problems and questions in complex function theory provide a new approach to the study of scattering problems…
The concept of the analytic signal is extended from the case of a real signal with a complex analytic signal to a complex signal with a hypercomplex analytic signal (which we call a hyperanalytic signal) The hyperanalytic signal may be…
Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense…
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…
In this current article, we introduce the quadruple Shehu transform and its inverse. We also introduce some properties of quadruple Shehu transform. The Convolution theorem and its proof are also discussed. Further, to solve homogeneous and…
For the solution of partial differential equations (PDEs), we show that the quantum Fourier transform (QFT) can enable the design of quantum circuits that are particularly simple, both conceptually and with regard to hardware requirements.…
In this study, we introduce and explore a delay differential equation that lends itself to explicit solutions in the Fourier-transformed space. Through the careful alignment of the initial function, we can construct a highly accurate…
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…
The quaternion Fourier transform (qFT) is an important tool in multi-dimensional data analysis, in particular for the study of color images. An important problem when applying the qFT is the mismatch between the spatial and frequency…
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…
In this paper we show an alternative way of defining Fourier Series and Transform by using the concept of convolution with exponential signals. This approach has the advantage of simplifying proofs of transforms properties and, in our view,…
In this paper we explain how to use the Fast Fourier Transform (FFT) to solve partial differential equations (PDEs). We start by defining appropriate discrete domains in coordinate and frequency domains. Then describe the main limitation of…
- 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…
A new method of quantum state tomography for quantum information processing is described. The method based on two-dimensional Fourier transform technique involves detection of all the off-diagonal elements of the density matrix in a…