Related papers: Sampling Fourier Transforms on Different Domains

We study the problem of stable reconstruction of the short-time Fourier transform from samples taken from trajectories in $\R^2$. We first consider the interplay between relative density of the trajectory and the reconstruction property.…

We prove a lower bound on the probability of Shor's order-finding algorithm successfully recovering the order $r$ in a single run. The bound implies that by performing two limited searches in the classical post-processing part of the…

With the advancement of quantum technologies, there is a potential threat to traditional encryption systems based on integer factorization. Therefore, developing techniques for accurately measuring the performance of associated quantum…

We develop a novel sampling theorem on the sphere and corresponding fast algorithms by associating the sphere with the torus through a periodic extension. The fundamental property of any sampling theorem is the number of samples required to…

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…

By recourse to tempered ultradistributions, we show here that the effect of a q-Fourier transform (qFT) is to map {\it equivalence classes} of functions into other classes in a one-to-one fashion. This suggests that Tsallis' q-statistics…

The Fourier transform, known in classical analysis, and generalized in abstract harmonic analysis, can also be considered in the theory of locally compact quantum groups. In this note, I discuss some aspects of this more general Fourier…

Based on Beurling's theory of balayage, we develop the theory of non-uniform sampling in the context of the theory of frames for the settings of the Short Time Fourier Transform and pseudo-differential operators. There is sufficient…

Optimal sampling of non band-limited functions is an issue of great importance that has attracted considerable attention. We propose to tackle this problem through the use of a frequency warping: First, by a nonlinear shrinking of…

A refinement of Shor's Algorithm for determining order is introduced, which determines a divisor of the order after any one run of a quantum computer with almost absolute certainty. The information garnered from each run is accumulated to…

Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…

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)…

We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k << N significant Fourier coefficients from a signal of bandwidth N. Previous deterministic algorithms exhibit quadratic…

Consider a fixed universe of $N=2^n$ elements and the uniform distribution over elements of some subset of size $K$. Given samples from this distribution, the task of complement sampling is to provide a sample from the complementary subset.…

We describe a scalable distributed imaging algorithm framework for next-generation radio telescopes, managing the Fourier transform from apertures to sky (or vice versa) with a focus on minimising memory load, data transfers, and…

Given n=p*q with p and q prim and y in Z_{p*q}^*. Shor's Algorithm computes the order r of y, i.e. y^r=1 (mod n). If r=2k is even and y^k \ne -1 (mod n) we can easily compute a non trivial factor of n: gcd(y^k-1,n). In the original paper it…

We investigate the physical implementation of Shor's factorization algorithm on a Josephson charge qubit register. While we pursue a universal method to factor a composite integer of any size, the scheme is demonstrated for the number 21.…

Shor's factoring algorithm (SFA), by its ability to efficiently factor large numbers, has the potential to undermine contemporary encryption. At its heart is a process called order finding, which quantum mechanics lets us perform…

We consider the problem of approximating two, possibly unrelated probability distributions from a single complex-valued function $\psi$ and its Fourier transform. We show that this problem always has a solution within a specified degree of…

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…