Exact bounds on the amplitude and phase of the interval discrete Fourier transform in polynomial time

We elucidate why an interval algorithm that computes the exact bounds on the amplitude and phase of the discrete Fourier transform can run in polynomial time. We address this question from a formal perspective to provide the mathematical foundations underpinning such an algorithm. We show that the procedure set out by the algorithm fully addresses the dependency problem of interval arithmetic, making it usable in a variety of applications involving the discrete Fourier transform. For example when analysing signals with poor precision, signals with missing data, and for automatic error propagation and verified computations

Characterization of the Crab Pulsar's Timing Noise

We present a power spectral analysis of the Crab pulsar's timing noise, mainly using radio measurements from Jodrell Bank taken over the period 1982-1989. The power spectral analysis is complicated by nonuniform data sampling and the presence of a steep red power spectrum that can distort power spectra measurement by causing severe power ``leakage''. We develop a simple windowing method for computing red noise power spectra of uniformly sampled data sets and test it on Monte Carlo generated sample realizations of red power-law noise. We generalize time-domain methods of generating power-law red noise with even integer spectral indices to the case of noninteger spectral indices. The Jodrell Bank pulse phase residuals are dense and smooth enough that an interpolation onto a uniform time series is possible. A windowed power spectrum is computed revealing a periodic or nearly periodic component with a period of about 568 days and a 1/f^3 power-law noise component with a noise strength of 1.24 +/- 0.067 10^{-16} cycles^2/sec^2 over the analysis frequency range 0.003 - 0.1 cycles/day. This result deviates from past analyses which characterized the pulse phase timing residuals as either 1/f^4 power-law noise or a quasiperiodic process. The analysis was checked using the Deeter polynomial method of power spectrum estimation that was developed for the case of nonuniform sampling, but has lower spectral resolution. The timing noise is consistent with a torque noise spectrum rising with analysis frequency as f implying blue torque noise, a result not predicted by current models of pulsar timing noise. If the periodic or nearly periodic component is due to a binary companion, we find a companion mass > 3.2 Earth masses.Comment: 53 pages, 9 figures, submitted to MNRAS, abstract condense

Quantum Algorithms for Some Hidden Shift Problems

Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structures of functions, especially periodicity. The fact that Fourier transforms can also be used to capture shift structure has received far less attention in the context of quantum computation. In this paper, we present three examples of "unknown shift" problems that can be solved efficiently on a quantum computer using the quantum Fourier transform. For one of these problems, the shifted Legendre symbol problem, we give evidence that the problem is hard to solve classically, by showing a reduction from breaking algebraically homomorphic cryptosystems. We also define the hidden coset problem, which generalizes the hidden shift problem and the hidden subgroup problem. This framework provides a unified way of viewing the ability of the Fourier transform to capture subgroup and shift structure

Closed-form inverses for the mixed pixel/multipath interference problem in AMCW lidar

We present two new closed-form methods for mixed pixel/multipath interference separation in AMCW lidar systems. The mixed pixel/multipath interference problem arises from the violation of a standard range-imaging assumption that each pixel integrates over only a single, discrete backscattering source. While a numerical inversion method has previously been proposed, no close-form inverses have previously been posited. The first new method models reflectivity as a Cauchy distribution over range and uses four measurements at different modulation frequencies to determine the amplitude, phase and reflectivity distribution of up to two component returns within each pixel. The second new method uses attenuation ratios to determine the amplitude and phase of up to two component returns within each pixel. The methods are tested on both simulated and real data and shown to produce a significant improvement in overall error. While this paper focusses on the AMCW mixed pixel/multipath interference problem, the algorithms contained herein have applicability to the reconstruction of a sparse one dimensional signal from an extremely limited number of discrete samples of its Fourier transform

Discrete coherent and squeezed states of many-qudit systems

We consider the phase space for a system of $n$ identical qudits (each one of dimension $d$, with $d$ a primer number) as a grid of $d^{n} \times d^{n}$ points and use the finite field $GF(d^{n})$ to label the corresponding axes. The associated displacement operators permit to define $s$-parametrized quasidistribution functions in this grid, with properties analogous to their continuous counterparts. These displacements allow also for the construction of finite coherent states, once a fiducial state is fixed. We take this reference as one eigenstate of the discrete Fourier transform and study the factorization properties of the resulting coherent states. We extend these ideas to include discrete squeezed states, and show their intriguing relation with entangled states between different qudits.Comment: 11 pages, 3 eps figures. Submitted for publicatio