47,708 research outputs found
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
A quantum computer can efficiently find the order of an element in a group,
factors of composite integers, discrete logarithms, stabilisers in Abelian
groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already
known how to phrase the first four problems as the estimation of eigenvalues of
certain unitary operators. Here we show how the solution to the more general
Abelian `hidden subgroup problem' can also be described and analysed as such.
We then point out how certain instances of these problems can be solved with
only one control qubit, or `flying qubits', instead of entire registers of
control qubits.Comment: 16 pages, 3 figures, LaTeX2e, to appear in Proceedings of the 1st
NASA International Conference on Quantum Computing and Quantum Communication
(Springer-Verlag
High-order, Dispersionless "Fast-Hybrid" Wave Equation Solver. Part I: Sampling Cost via Incident-Field Windowing and Recentering
This paper proposes a frequency/time hybrid integral-equation method for the
time dependent wave equation in two and three-dimensional spatial domains.
Relying on Fourier Transformation in time, the method utilizes a fixed
(time-independent) number of frequency-domain integral-equation solutions to
evaluate, with superalgebraically-small errors, time domain solutions for
arbitrarily long times. The approach relies on two main elements, namely, 1) A
smooth time-windowing methodology that enables accurate band-limited
representations for arbitrarily-long time signals, and 2) A novel Fourier
transform approach which, in a time-parallel manner and without causing
spurious periodicity effects, delivers numerically dispersionless
spectrally-accurate solutions. A similar hybrid technique can be obtained on
the basis of Laplace transforms instead of Fourier transforms, but we do not
consider the Laplace-based method in the present contribution. The algorithm
can handle dispersive media, it can tackle complex physical structures, it
enables parallelization in time in a straightforward manner, and it allows for
time leaping---that is, solution sampling at any given time at
-bounded sampling cost, for arbitrarily large values of ,
and without requirement of evaluation of the solution at intermediate times.
The proposed frequency-time hybridization strategy, which generalizes to any
linear partial differential equation in the time domain for which
frequency-domain solutions can be obtained (including e.g. the time-domain
Maxwell equations), and which is applicable in a wide range of scientific and
engineering contexts, provides significant advantages over other available
alternatives such as volumetric discretization, time-domain integral equations,
and convolution-quadrature approaches.Comment: 33 pages, 8 figures, revised and extended manuscript (and now
including direct comparisons to existing CQ and TDIE solver implementations)
(Part I of II
A Multivariate Fast Discrete Walsh Transform with an Application to Function Interpolation
For high dimensional problems, such as approximation and integration, one
cannot afford to sample on a grid because of the curse of dimensionality. An
attractive alternative is to sample on a low discrepancy set, such as an
integration lattice or a digital net. This article introduces a multivariate
fast discrete Walsh transform for data sampled on a digital net that requires
only operations, where is the number of data points. This
algorithm and its inverse are digital analogs of multivariate fast Fourier
transforms.
This fast discrete Walsh transform and its inverse may be used to approximate
the Walsh coefficients of a function and then construct a spline interpolant of
the function. This interpolant may then be used to estimate the function's
effective dimension, an important concept in the theory of numerical
multivariate integration. Numerical results for various functions are
presented
Computing with functions in spherical and polar geometries I. The sphere
A collection of algorithms is described for numerically computing with smooth
functions defined on the unit sphere. Functions are approximated to essentially
machine precision by using a structure-preserving iterative variant of Gaussian
elimination together with the double Fourier sphere method. We show that this
procedure allows for stable differentiation, reduces the oversampling of
functions near the poles, and converges for certain analytic functions.
Operations such as function evaluation, differentiation, and integration are
particularly efficient and can be computed by essentially one-dimensional
algorithms. A highlight is an optimal complexity direct solver for Poisson's
equation on the sphere using a spectral method. Without parallelization, we
solve Poisson's equation with million degrees of freedom in one minute on
a standard laptop. Numerical results are presented throughout. In a companion
paper (part II) we extend the ideas presented here to computing with functions
on the disk.Comment: 23 page
Map online system using internet-based image catalogue
Digital maps carry along its geodata information such as coordinate that is important in one particular topographic and thematic map. These geodatas are meaningful especially in military field. Since the maps carry along this information, its makes the size of the images is too big. The bigger size, the bigger storage is required to allocate the image file. It also can cause longer loading time. These conditions make it did not suitable to be applied in image catalogue approach via internet environment. With compression techniques, the image size can be reduced and the quality of the image is still guaranteed without much changes. This report is paying attention to one of the image compression technique using wavelet technology. Wavelet technology is much batter than any other image compression technique nowadays. As a result, the compressed images applied to a system called Map Online that used Internet-based Image Catalogue approach. This system allowed user to buy map online. User also can download the maps that had been bought besides using the searching the map. Map searching is based on several meaningful keywords. As a result, this system is expected to be used by Jabatan Ukur dan Pemetaan Malaysia (JUPEM) in order to make the organization vision is implemented
- …