On a problem in quantum summation

Authors:
Stefan Heinrich;Erich Novak
Affiliations:
Fachbereich Informatik, Universität Kaiserslautern, Postfach 3049, D-67653 Kaiserslautern, Germany;Mathematisches Institut, Universität Jena, D-07740 Jena, Germany
Venue:
Journal of Complexity
Year:
2003

Citing 11
Cited 10

Information-based complexity

Information-based complexity
The real number model in numerical analysis

Journal of Complexity
A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A framework for fast quantum mechanical algorithms

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The quantum query complexity of approximating the median and related statistics

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum complexity of integration

Journal of Complexity
An Introduction to Quantum Computing Algorithms

An Introduction to Quantum Computing Algorithms
Quantum computation and quantum information

Quantum computation and quantum information
Quantum summation with an application to integration

Journal of Complexity
Quantum integration in Sobolev classes

Journal of Complexity
Quantum Lower Bounds by Polynomials

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Quantum summation with an application to integration

Journal of Complexity
Quantum integration in Sobolev classes

Journal of Complexity
From Monte Carlo to quantum computation

Mathematics and Computers in Simulation - Special issue: 3rd IMACS seminar on Monte Carlo methods - MCM 2001
Quantum approximation I. Embeddings of finite-dimensional Lp spaces

Journal of Complexity
Quantum approximation II. Sobolev embeddings

Journal of Complexity
Sharp error bounds on quantum Boolean summation in various settings

Journal of Complexity
Quantum lower bounds by entropy numbers

Journal of Complexity
Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms

Journal of Approximation Theory
Quantum integration error for some sobolev classes

ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Numerical analysis on a quantum computer

LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 p- summability condition for 1 ≤ p 2. This settles a problem left open in Heinrich (J. Complexity 18 (2002) 1).