Related papers: Efficient Quantum Fourier Transforms For Semisimpl…
Wavelet transforms are widely used in various fields of science and engineering as a mathematical tool with features that reveal information ignored by the Fourier transform. Unlike the Fourier transform, which is unique, a wavelet…
We describe an efficient quantum algorithm for the quantum Schur transform. The Schur transform is an operation on a quantum computer that maps the standard computational basis to a basis composed of irreducible representations of the…
In this research, we create a scalable version of the quantum Fourier transform-based arithmetic circuit to perform addition and subtraction operations on N n-bit unsigned integers encoded in quantum registers, and it is compatible with…
As the most central and computationally intensive component of deep neural networks, the execution efficiency of matrix multiplication directly determines the training and inference performance of models. Harnessing the parallel processing…
The non-equidistant fast Fourier transform (NFFT) is an extension of the famous fast Fourier transform (FFT), which can be applied to non-equidistantly sampled data in time/space or frequency domain. It is an approximative algorithm that…
The Quaternion Fourier transform (QFT) is one of the key tools in studying color image processing. Indeed, a deep understanding of the QFT has created the color images to be transformed as whole, rather than as color separated component. In…
Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions,…
For a finite dimensional semisimple Lie algebra ${\frak{g}}$ and a root $q$ of unity in a field $k,$ we associate to these data a double quiver $\bar{\cal{Q}}.$ It is shown that a restricted version of the quantized enveloping algebras…
Digital Transforms have important applications on subjects such as channel coding, cryptography and digital signal processing. In this paper, two Fourier Transforms are considered, the discrete time Fourier transform (DTFT) and the finite…
Rapid development in quantum computing leads to the appearance of several quantum applications. Quantum Fourier Transformation (QFT) sits at the heart of many of these applications. Existing work leverages SAT solver or heuristics to…
The quadratic phase Fourier transform QPFT is a neoteric addition to the class of Fourier transforms and embodies a variety of signal processing tools including the Fourier, fractional Fourier, linear canonical, and special affine Fourier…
This paper aims to explore the inherent connection among Heisenberg groups, quantum Fourier transform and (quasiprobability) distribution functions. Distribution functions for continuous and finite quantum systems are examined first as a…
Edge devices are being deployed at increasing volumes to sense and act on information from the physical world. The discrete Fourier transform (DFT) is often necessary to make this sensed data suitable for further processing -- such as by…
In this work, we develop a highly efficient representation of functions and differential operators based on Fourier analysis. Using this representation, we create a variational hybrid quantum algorithm to solve static, Schr\"odinger-type,…
The Quantum Fourier Transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing Quantum Fourier Transform adders and multipliers and propose some modifications that extend their…
The quantum Fourier transform and quantum wavelet transform have been cornerstones of quantum information processing. However, for non-stationary signals and anomaly detection, the Hilbert transform can be a more powerful tool, yet no prior…
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…
Fourier representations play a central role in operator learning methods for partial differential equations and are increasingly being explored in quantum machine learning architectures. The classical fast Fourier transform (FFT),…
In this contribution we generalize the classical Fourier Mellin transform [S. Dorrode and F. Ghorbel, Robust and efficient Fourier-Mellin transform approximations for gray-level image reconstruction and complete invariant description,…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…