Related papers: Two-sided Clifford Fourier transform with two squa…
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms,…
In this note we describe a simple and intriguing observation: the quantum Fourier transform (QFT) over $Z_q$, which is considered the most ``quantum'' part of Shor's algorithm, can in fact be simulated efficiently by classical computers.…
A particular orthogonal map on a finite dimensional real quadratic vector space (V,Q) with a non-degenerate quadratic form Q of any signature (p,q) is considered. It can be viewed as a correlation of the vector space that leads to a dual…
The paper contains a systematic theory of the one-dimensional Double Hecke algebra, including applications to the difference Fourier transform, Macdonald's polynomials, Gaussian sums at roots of unity, and Verlinde algebras. The main result…
Using the analytic properties of two-point functions in QCD, as well as unitarity, bounds on the B meson form factor F(q^2) can be derived. Heavy quark spin symmetry, correctly taken into account, is shown to improve these bounds…
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 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…
We show how for $n=2,3 (\mod 4)$ continuous Clifford (geometric) algebra (GA) $Cl_n$-valued admissible wavelets can be constructed using the similitude group $SIM(n)$. We strictly aim for real geometric interpretation, and replace the…
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…
The graph Fourier transform (GFT) is an important tool for graph signal processing, with applications ranging from graph-based image processing to spectral clustering. However, unlike the discrete Fourier transform, the GFT typically does…
Quantum Fourier transformation is important in many quantum algorithms. In this paper, we generalize quantum Fourier transformation over the Abelian group $\mathbb{Z}_N$ from two different points to get more efficient unitary…
In~\cite{sic-magazine-2025}, the authors show that the square index coefficients (SICs) of the $N$-point discrete Fourier transform (DFT) -- that is, the coefficients $X_{k\sqrt{N}}$ for $k = 0, 1, \ldots, \sqrt{N} - 1$ -- can be losslessly…
Clifford geometric algebras of multivectors are introduced which exhibit a bilinear form which is not necessarily symmetric. Looking at a subset of bi-vectors in CL(K^{2n},B), we proof that theses elements generate the Hecke algebra…
We derive a set of Clifford-algebraic formulas for two major nonlinear conformal transformations of the physical quantities related to Maxwell's equations. The superiority of these formulas over their vector-tensorial counterparts are…
Littlewood--Paley theory is a fundamental tool for frequency localization, square-function control, and multiplier analysis, yet a systematic counterpart in the fractional Fourier transform (FrFT) setting has remained incomplete. We develop…
One of the key challenges in the area of signal processing on graphs is to design transforms and dictionaries methods to identify and exploit structure in signals on weighted graphs. In this paper, we first generalize graph Fourier…
We consider Clifford algebras over the field of real or complex numbers as a quotient algebra without fixed basis. We present classification of Clifford algebra elements based on the notion of quaternion type. This classification allows us…
This paper is divided in three parts. In the first part, I study the Clifford algebra associated to the hessian of a functional $f$ defined on an open subset of $\mathbb{R}^n$ \ and the Clifford algebra associated to the hessian of the…
The Clifford defect is a rational number associated to the Weierstrass semigroup at a given point of an algebraic curve. It describes the error-correcting capability of the so-called Modified Algorithm for decoding the corresponding…
The Fourier expansion of the loss function in variational quantum algorithms (VQA) contains a wealth of information, yet is generally hard to access. We focus on the class of variational circuits, where constant gates are Clifford gates and…