Related papers: An in-place truncated Fourier transform
We consider a version of Shor's quantum factoring algorithm such that the quantum Fourier transform is replaced by an extremely simple one where decomposition coefficients take only the values of $1,i,-1,-i$. In numerous calculations which…
The solution of a problem arising in integrable systems requires sharp asymptotics for the inverses and determinants of truncated Wiener-Hopf operators, both in the regular case (where the non-truncated Wiener-Hopf operator is invertible)…
In this paper, we present and prove a new truncated $\mathcal{V}$-fractional Taylor's formula using the truncated $\mathcal{V}$-fractional variation of constants formula. In this sense, we present the truncated $\mathcal{V}$-fractional…
We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyse quantum networks performing AQFT in the presence of decoherence and show that extensive…
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place convolutions, the memory requirements are identical with the…
Convolutional neural network (CNN) is one of the most widely-used successful architectures in the era of deep learning. However, the high-computational cost of CNN still hampers more universal uses to light devices. Fortunately, the Fourier…
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform…
In this paper, we study the inversion formula for recovering a function from its windowed Fourier transform. We give a rigorous proof for an inversion formula which is known in engineering. We show that the integral involved in the formula…
We introduce a new numerical method for the computation of the inverse nonlinear Fourier transform and compare its computational complexity and accuracy to those of other methods available in the literature. For a given accuracy, the…
The translation of Grover's search algorithm from its standard version, designed for implementation on a single quantum system amenable to projective measurements, into one suitable for an ensemble of quantum computers, whose outputs are…
We revisit the problem of permuting an array of length $n$ according to a given permutation in place, that is, using only a small number of bits of extra storage. Fich, Munro and Poblete [FOCS 1990, SICOMP 1995] obtained an elegant…
We present an asymptotically improved algorithm for implementing the Quantum Fourier Transform (QFT) in both the exact and approximate settings. Historically, the approximate QFT has been implemented in $\Theta(n \log n)$ gates, and the…
We present a spectrally accurate fast algorithm for evaluating the solution to the scalar wave equation in free space driven by a large collection of point sources in a bounded domain. With $M$ sources temporally discretized by $N_t$ time…
In this note we propose a generalization of the Laplace and Fourier transforms which we call symmetric Laplace transform. It combines both the advantages of the Fourier and Laplace transforms. We give the definition of this generalization,…
We propose an implementation of the quantum fast Fourier transform algorithm in an entangled system of multilevel atoms. The Fourier transform occurs naturally in the unitary time evolution of energy eigenstates and is used to define an…
We provide in this paper simulation algorithms for one-sided and two-sided truncated normal distributions. These algorithms are then used to simulate multivariate normal variables with restricted parameter space for any covariance…
We develop the pruned continuous Haar transform and the fast continuous Fourier series, two fast and efficient algorithms for rectilinear polygons. Rectilinear polygons are used in VLSI processes to describe design and mask layouts of…
We introduce a fast and easy-to-implement simulation algorithm for a multivariate normal distribution truncated on the intersection of a set of hyperplanes, and further generalize it to efficiently simulate random variables from a…
In this paper we generalize Drinfeld's twisted quantum affine algebras to construct twisted quantum algebras for all simply-laced generalized Cartan matrices and present their vertex representation realizations.
In some of the problems, complicated functions of the Z-transform variable, $z$, appear which either cannot be inverted analytically or the required calculations are quite tedious. In such cases numerical methods should be used to find the…