Related papers: The windowed quadratic phase Fourier transform: st…
In this paper, we investigate the (two-sided) quaternion windowed linear canonical transform (QWLCT) and study the uncertainty principles associated with the QWLCT. Firstly, several important properties of the QWLCT such as bounded, shift,…
Warped conformal field theories (WCFTs) are a novel class of non-relativistic theories. A simple, yet non-trivial, example of such theory is a massive Weyl fermion in $(1+1)$-dimensions, which we study in detail. We derive general…
Molecular spin qudits based on lanthanide complexes offer a promising platform for quantum technologies, combining chemical tunability with multi-level encoding. However, experimental demonstrations of their envisaged capabilities remain…
In this paper extensions of the classical Fourier, fractional Fourier and Radon transforms to superspace are studied. Previously, a Fourier transform in superspace was already studied, but with a different kernel. In this work, the…
The discrete Fourier transform (DFT) is of fundamental interest in photonic quantum information, yet the ability to scale it to high dimensions depends heavily on the physical encoding, with practical recipes lacking in emerging platforms…
In this paper, we study the inversion formula for recovering a function from its windowed Fourier transform. We give a rigorous proof for an inversion formula which is known in engineering. We show that the integral involved in the formula…
Quantum harmonic analysis on phase space is shown to be linked with localization operators. The convolution between operators and the convolution between a function and an operator provide a conceptual framework for the theory of…
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…
The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a…
We find a new integration transformation which can convert a chirplet function to fractional Fourier transformation kernel, this new transformation is invertible and obeys Parseval theorem. Under this transformation a new relationship…
In this paper we study the nonuniform fast Fourier transform with nonequispaced spatial and frequency data (NNFFT) and the fast sinc transform as its application. The computation of NNFFT is mainly based on the nonuniform fast Fourier…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
Geometrical and topological phases play a fundamental role in quantum theory. Geometric phases have been proposed as a tool for implementing unitary gates for quantum computation. A fractional topological phase has been recently discovered…
Galois rings are regarded as "building blocks" of a finite commutative ring with identity. There have been many papers on classical error correction codes over Galois rings published. As an important warm-up before exploring quantum…
In this paper, we present a construction toward a new type of TQFTs at the crossroads of low-dimensional topology, algebraic geometry, physics, and homotopy theory. It assigns TMF-modules to closed 3-manifolds and maps of TMF-modules to…
Quantum Fourier transform (QFT) is a key ingredient of many quantum algorithms where a considerable amount of ancilla qubits and gates are often needed to form a Hilbert space large enough for high-precision results. Qubit recycling reduces…
The properties of the Gabor and Morlet transforms are examined with respect to the Fourier analysis of discretely sampled data. Forward and inverse transform pairs based on a fixed window with uniform sampling of the frequency axis can…
One of the key challenges in the area of signal processing on graphs is to design dictionaries and transform methods to identify and exploit structure in signals on weighted graphs. To do so, we need to account for the intrinsic geometric…
The nonlinear Fourier transform (NLFT) extends the classical Fourier transform by replacing addition with matrix multiplication. While the NLFT on $\mathrm{SU}(1,1)$ has been widely studied, its $\mathrm{SU}(2)$ variant has only recently…
This paper explores the innovative application of the Fractional Fourier Transform (FrFT) in sound synthesis, highlighting its potential to redefine time-frequency analysis in audio processing. As an extension of the classical Fourier…