Related papers: Quadratic discrete Fourier transform and mutually …
This paper examines the existence and region of convergence of Fourier transform of the functions of bicomplex variables with the help of projection on its idempotent components as auxiliary complex planes. Several basic properties of this…
The nonlinear Fourier transform discussed in these notes is the map from the potential of a one dimensional discrete Dirac operator to the transmission and reflection coefficients thereof. Emphasis is on this being a nonlinear variant of…
Mutual unbiasedness of the eigenstates of phase-space operators-such as position and momentum, or their standard coarse grained versions-exists only in the limiting case of infinite squeezing. In [Phys. Rev. Lett. 120, 040403 (2018)] it was…
In this paper, we extend the quadratic phase Fourier transform of a complex valued functions to that of the quaternion valued functions of two variables. We call it the quaternion quadratic phase Fourier transform (QQPFT). Based on the…
This paper presents the quartic public key transformation which can be used for public key applications if side information is also used. This extends an earlier work where the cubic transformation was similarly used. Such a transformation…
This paper has several major purposes. The central purpose is to describe the "Benford analysis" of a positive random variable and to summarize some results from investigations into base dependence of Benford random variables. The principal…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
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…
Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois…
Fourier transform is applied to annular beams of simplified flat two-level geometry: bright outer ring with a darker core. The pattern of focal beam profile (i.e. far field) is calculated and characterized with respect of its intensity…
We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…
After surveying the quantum kinematics and dynamics of statistical transmutation, I show how this concept suggests a phase diagram for the two-dimensional matter in a magnetic field, as a function of quantum statistics. I discuss the…
We propose a unifying phase-space approach to the construction of mutually unbiased bases for a two-qubit system. It is based on an explicit classification of the geometrical structures compatible with the notion of unbiasedness. These…
We propose a new integral based on Taylor measures, study its properties extensively, and we illustrate that it includes many concepts from mathematics as special cases. In particular, the new integral emerges as a generalization of the…
A complete set of d+1 mutually unbiased bases exists in a Hilbert spaces of dimension d, whenever d is a power of a prime. We discuss a simple construction of d+1 disjoint classes (each one having d-1 commuting operators) such that the…
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,…
The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the…
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…
High-throughput approximations of quantum mechanics calculations and combinatorial experiments have been traditionally used to reduce the search space of possible molecules, drugs and materials. However, the interplay of structural and…
In this Letter, we present a physical scheme for implementing the discrete quantum Fourier transform in a coupled semiconductor double quantum dot system. The main controlled-R gate operation can be decomposed into many simple and feasible…