Related papers: Three quick recipes with fully extended oriented 2…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
This note concerns exponential sheaves and the "universal" Fourier transform on them. Fourier invertibility and the subsequent Fourier miracle is demonstrated. Further, t-structures and realizations are constructed and shown to have…
Natural language processing (NLP) made an impressive jump with the introduction of Transformers. ChatGPT is one of the most famous examples, changing the perception of the possibilities of AI even outside the research community. However,…
The Donald-Flanigan conjecture asserts that for any finite group and for any field, the corresponding group algebra can be deformed to a separable algebra. The minimal unsolved instance, namely the quaternion group over a field of…
This notes explains how a standard algorithm that constructs the discrete Fourier transform has been formalised and proved correct in the Coq proof assistant using the SSReflect extension.
The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…
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…
In recent years it has turned out that shearlets have the potential to retrieve directional information so that they became interesting for many applications. Moreover the continuous shearlet transform has the outstanding property to stem…
Via (C,F)-construction we produce a 2-fold simple mixing transformation which has uncountably many non-trivial proper factors and all of them are prime.
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…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
The notion of Fourier transform is among the more important tools in analysis, which has been generalized in abstract harmonic analysis to the level of abelian locally compact groups. The aim of this paper is to further generalize the…
Directional transforms have recently raised a lot of interest thanks to their numerous applications in signal compression and analysis. In this letter, we introduce a generalization of the discrete Fourier transform, called steerable DFT…
The numerical simulation of domain wall quarks with the two-step multi-boson (TSMB) algorithm is considered. The inclusion of single quark flavours, as required for strange quarks, is discussed. The usage of computer memory can be kept…
This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…
The nonuniform discrete Fourier transform (NUDFT) and its inverse are widely used in various fields of scientific computing. In this article, we propose a novel superfast direct inversion method for type-III NUDFT. The proposed method…
In recent years there has been a growing interest in the fractional Fourier transform driven by its large number of applications. The literature in this field follows two main routes. On the one hand, the areas where the ordinary Fourier…
By viewing the nonuniform discrete Fourier transform (NUDFT) as a perturbed version of a uniform discrete Fourier transform, we propose a fast, stable, and simple algorithm for computing the NUDFT that costs $\mathcal{O}(N\log…
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…
The nonuniform fast Fourier transform (NUFFT) generalizes the FFT to off-grid data. Its many applications include image reconstruction, data analysis, and the numerical solution of differential equations. We present FINUFFT, an efficient…