242 research outputs found
Comprehensive theory of the relative phase in atom-field interactions
We explore the role played by the quantum relative phase in a well-known
model of atom-field interaction, namely, the Dicke model. We introduce an
appropriate polar decomposition of the atom-field relative amplitudes that
leads to a truly Hermitian relative-phase operator, whose eigenstates correctly
describe the phase properties, as we demonstrate by studying the positive
operator-valued measure derived from it. We find the probability distribution
for this relative phase and, by resorting to a numerical procedure, we study
its time evolution.Comment: 20 pages, 4 figures, submitted to Phys. Rev.
Sampling functions for multimode homodyne tomography with a single local oscillator
We derive various sampling functions for multimode homodyne tomography with a
single local oscillator. These functions allow us to sample multimode
s-parametrized quasidistributions, density matrix elements in Fock basis, and
s-ordered moments of arbitrary order directly from the measured quadrature
statistics. The inevitable experimental losses can be compensated by proper
modification of the sampling functions. Results of Monte Carlo simulations for
squeezed three-mode state are reported and the feasibility of reconstruction of
the three-mode Q-function and s-ordered moments from 10^7 sampled data is
demonstrated.Comment: 12 pages, 8 figures, REVTeX, submitted Phys. Rev.
Approximation with Random Bases: Pro et Contra
In this work we discuss the problem of selecting suitable approximators from
families of parameterized elementary functions that are known to be dense in a
Hilbert space of functions. We consider and analyze published procedures, both
randomized and deterministic, for selecting elements from these families that
have been shown to ensure the rate of convergence in norm of order
, where is the number of elements. We show that both randomized and
deterministic procedures are successful if additional information about the
families of functions to be approximated is provided. In the absence of such
additional information one may observe exponential growth of the number of
terms needed to approximate the function and/or extreme sensitivity of the
outcome of the approximation to parameters. Implications of our analysis for
applications of neural networks in modeling and control are illustrated with
examples.Comment: arXiv admin note: text overlap with arXiv:0905.067
Fast Computation of Fourier Integral Operators
We introduce a general purpose algorithm for rapidly computing certain types
of oscillatory integrals which frequently arise in problems connected to wave
propagation and general hyperbolic equations. The problem is to evaluate
numerically a so-called Fourier integral operator (FIO) of the form at points given on
a Cartesian grid. Here, is a frequency variable, is the
Fourier transform of the input , is an amplitude and
is a phase function, which is typically as large as ;
hence the integral is highly oscillatory at high frequencies. Because an FIO is
a dense matrix, a naive matrix vector product with an input given on a
Cartesian grid of size by would require operations.
This paper develops a new numerical algorithm which requires operations, and as low as in storage space. It operates by
localizing the integral over polar wedges with small angular aperture in the
frequency plane. On each wedge, the algorithm factorizes the kernel into two components: 1) a diffeomorphism which is
handled by means of a nonuniform FFT and 2) a residual factor which is handled
by numerical separation of the spatial and frequency variables. The key to the
complexity and accuracy estimates is that the separation rank of the residual
kernel is \emph{provably independent of the problem size}. Several numerical
examples demonstrate the efficiency and accuracy of the proposed methodology.
We also discuss the potential of our ideas for various applications such as
reflection seismology.Comment: 31 pages, 3 figure
- …