3,991 research outputs found
Quantum Integration in Sobolev Classes
We study high dimensional integration in the quantum model of computation. We
develop quantum algorithms for integration of functions from Sobolev classes
and analyze their convergence rates. We also prove lower
bounds which show that the proposed algorithms are, in many cases, optimal
within the setting of quantum computing. This extends recent results of Novak
on integration of functions from H\"older classes.Comment: Paper submitted to the Journal of Complexity. 28 page
Optimal Summation and Integration by Deterministic, Randomized, and Quantum Algorithms
We survey old and new results about optimal algorithms for summation of
finite sequences and for integration of functions from Hoelder or Sobolev
spaces. First we discuss optimal deterministic and randomized algorithms. Then
we add a new aspect, which has not been covered before on conferences about
(quasi-) Monte Carlo methods: quantum computation. We give a short introduction
into this setting and present recent results of the authors on optimal quantum
algorithms for summation and integration. We discuss comparisons between the
three settings. The most interesting case for Monte Carlo and quantum
integration is that of moderate smoothness k and large dimension d which, in
fact, occurs in a number of important applied problems. In that case the
deterministic exponent is negligible, so the n^{-1/2} Monte Carlo and the
n^{-1} quantum speedup essentially constitute the entire convergence rate. We
observe that -- there is an exponential speed-up of quantum algorithms over
deterministic (classical) algorithms, if k/d tends to zero; -- there is a
(roughly) quadratic speed-up of quantum algorithms over randomized classical
algorithms, if k/d is small.Comment: 13 pages, contribution to the 4th International Conference on Monte
Carlo and Quasi-Monte Carlo Methods, Hong Kong 200
Some Results on the Complexity of Numerical Integration
This is a survey (21 pages, 124 references) written for the MCQMC 2014
conference in Leuven, April 2014. We start with the seminal paper of Bakhvalov
(1959) and end with new results on the curse of dimension and on the complexity
of oscillatory integrals. Some small errors of earlier versions are corrected
Quantum Approximation II. Sobolev Embeddings
A basic problem of approximation theory, the approximation of functions from
the Sobolev space W_p^r([0,1]^d) in the norm of L_q([0,1]^d), is considered
from the point of view of quantum computation. We determine the quantum query
complexity of this problem (up to logarithmic factors). It turns out that in
certain regions of the domain of parameters p,q,r,d quantum computation can
reach a speedup of roughly squaring the rate of convergence of classical
deterministic or randomized approximation methods. There are other regions were
the best possible rates coincide for all three settings.Comment: 23 pages, paper submitted to the Journal of Complexit
Quantum singularities in (2+1) dimensional matter coupled black hole spacetimes
Quantum singularities considered in the 3D BTZ spacetime by Pitelli and
Letelier (Phys. Rev. D77: 124030, 2008) is extended to charged BTZ and 3D
Einstein-Maxwell-dilaton gravity spacetimes. The occurence of naked
singularities in the Einstein-Maxwell extension of the BTZ spacetime both in
linear and non-linear electrodynamics as well as in the
Einstein-Maxwell-dilaton gravity spacetimes are analysed with the quantum test
fields obeying the Klein-Gordon and Dirac equations. We show that with the
inclusion of the matter fields; the conical geometry near r=0 is removed and
restricted classes of solutions are admitted for the Klein-Gordon and Dirac
equations. Hence, the classical central singularity at r=0 turns out to be
quantum mechanically singular for quantum particles obeying Klein-Gordon
equation but nonsingular for fermions obeying Dirac equation. Explicit
calculations reveal that the occurrence of the timelike naked singularities in
the considered spacetimes do not violate the cosmic censorship hypothesis as
far as the Dirac fields are concerned. The role of horizons that clothes the
singularity in the black hole cases is replaced by repulsive potential barrier
against the propagation of Dirac fields.Comment: 13 pages, 1 figure. Final version, to appear in PR
On a Problem in Quantum Summation
We consider the computation of the mean of sequences in the quantum model of
computation. We determine the query complexity in the case of sequences which
satisfy a -summability condition for . This settles a problem left
open in Heinrich (2001).Comment: 21 pages, paper submitted to the Journal of Complexit
Quantum logarithmic Sobolev inequalities and rapid mixing
A family of logarithmic Sobolev inequalities on finite dimensional quantum
state spaces is introduced. The framework of non-commutative \bL_p-spaces is
reviewed and the relationship between quantum logarithmic Sobolev inequalities
and the hypercontractivity of quantum semigroups is discussed. This
relationship is central for the derivation of lower bounds for the logarithmic
Sobolev (LS) constants. Essential results for the family of inequalities are
proved, and we show an upper bound to the generalized LS constant in terms of
the spectral gap of the generator of the semigroup. These inequalities provide
a framework for the derivation of improved bounds on the convergence time of
quantum dynamical semigroups, when the LS constant and the spectral gap are of
the same order. Convergence bounds on finite dimensional state spaces are
particularly relevant for the field of quantum information theory. We provide a
number of examples, where improved bounds on the mixing time of several
semigroups are obtained; including the depolarizing semigroup and quantum
expanders.Comment: Updated manuscript, 30 pages, no figure
- …