Related papers: 3-Qubit Circular Quantum Convolution Computation u…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a…
In this paper we show an alternative way of defining Fourier Series and Transform by using the concept of convolution with exponential signals. This approach has the advantage of simplifying proofs of transforms properties and, in our view,…
The optimal phase covariant cloning machine (PQCM) broadcasts the information associated to an input qubit into a multi-qubit systems, exploiting a partial a-priori knowledge of the input state. This additional a priori information leads to…
The Fractional Fourier Transform is a ubiquitous signal processing tool in basic and applied sciences. The Fractional Fourier Transform generalizes every property and application of the Fourier Transform. Despite the practical importance of…
A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex…
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…
Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates…
Quantum computing algorithms using the quantum Fourier transform require repeated use of a phase shift gate. In the case of qubits using optical photons for operation, this gate can be implemented using single-photon beams focused close to…
An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the…
A general and fast method is conceived for computing the cyclic convolution of n points, where n is a prime number. This method fully exploits the internal structure of the cyclic matrix, and hence leads to significant reduction of the…
We study a quantum computer with fixed and permanent interaction of diagonal type between qubits. It is controlled only by one-qubit quick transformations. It is shown how to implement Quantum Fourier Transform and to solve Shroedinger…
Algorithms for processing data in short-time batches are critical for both online and offline processing of streamed and large data respectively due to the quadratic relation between signal length and computational cost of convolution-based…
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…
Fourier transform (FT) plays a crucial role in a broad range of applications, from enhancement, restoration and analysis through to security, compression and manipulation. The Fourier transform (FT) is a process that converts a function…
The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of…
We present the detailed process of converting the classical Fourier Transform algorithm into the quantum one by using QR decomposition. This provides an example of a technique for building quantum algorithms using classical ones. The…
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.…
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 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…