Quantum Complexity of Integration

  title={Quantum Complexity of Integration},
  author={Erich Novak},
  journal={J. Complex.},
  • E. Novak
  • Published 29 August 2000
  • Computer Science, Mathematics
  • J. Complex.
It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical Holder classes Fk, ?d on 0, 1]d and define ? by ?=(k+?)/d. The known optimal orders for the complexity of deterministic and (general) randomized methods are comp(Fk, ?d, ?)???1/? and comprandom(Fk, ?d, ?)???2/(1+2?). For a quantum computer we prove… 

Improved bounds on the randomized and quantum complexity of initial-value problems

  • B. Kacewicz
  • Computer Science, Mathematics
    J. Complex.
  • 2005

The Quantum Setting with Randomized Queries for Continuous Problems

It is proved that for path integration the authors have an exponential improvement for the qubit complexity over the quantum setting with deterministic queries, which limits the power of quantum computation for continuous problems.

Sharp error bounds on quantum Boolean summation in various settings

Quantum algorithms and complexity for certain continuous and related discrete problems

The thesis shows that in both the randomized and quantum settings the curse of dimensionality is vanquished, i.e., the minimal number of function evaluations and/or quantum queries required to compute an approximation depends only polynomially on the reciprocal of the desired accuracy and has a bound independent of the number of variables.

On the quantum and randomized approximation of linear functionals on function spaces

  • B. Kacewicz
  • Mathematics, Computer Science
    Quantum Inf. Process.
  • 2011
Lower bounds are provided on the power of quantum, randomized and deterministic algorithms for the exemplary problems, and some cases sharpness of the obtained results is compared.

The quantum query complexity of elliptic PDE

Path Integration on a Quantum Computer

A lower bound is obtained for the minimal number of quantum queries which shows that this bound cannot be significantly improved, and it is proved that path integration on a quantum computer is tractable.

Improved Upper Bounds on the Randomized and Quantum Complexity of Initial-Value Problems 1

This paper gives up the deterministic optimality of the basic algorithm, defining a new integral algorithm that is better suited for randomization and implementation of a quantum computer, and applies the optimal algorithms for summation of real numbers.

Randomized and quantum algorithms yield a speed-up for initial-value problems

  • B. Kacewicz
  • Computer Science, Mathematics
    J. Complex.
  • 2004

Randomized and quantum algorithms for solving initial-value problems in ordinary differential equations of order k

This paper considers two models of computation, the randomized model and the quantum model, and constructs almost optimal algorithms adjusted to scalar equations of higher order, without passing to systems of first order equations.



A fast quantum mechanical algorithm for database search

In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .

Tight bounds on quantum searching

A lower bound on the efficiency of any possible quantum database searching algorithm is provided and it is shown that Grover''s algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table.

The quantum query complexity of approximating the median and related statistics

The main ingredient in the proof is a polynomial degree lower bound for real multilinear polynomials that ``approximate'' symmetric partial boolean functions, which immediately yields lower bounds for the problems of approximating the kth-smallest element, approximates the mean of a sequence of numbers, and that of approximately counting the number of ones of a boolean function.

Quantum Counting

This work generalizes the Grover iteration in the light of a concept called amplitude amplification, and shows that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist.

Quantum Algorithms

New small size quantum computers are coming to age and the use of such a machine brings the possibility of exploring new quantum algorithms, which makes feasible attacking optimization problems, which are relevant for different industries.

A framework for fast quantum mechanical algorithms

The sqrt(N) step quantum search algorithm is an immediate consequence of a framework for the design and analysis of quantum mechanical algorithms, and several other search-type applications are presented.

The Monte Carlo Algorithm With a Pseudorandom Generator

Whether the good properties of the Monte Carlo algorithm for multivariate integration hold if pseudorandom numbers are used is investigated and it is suggested that such an analysis should be performed whenever randomization is used.

The Real Number Model in Numerical Analysis

  • E. Novak
  • Computer Science, Mathematics
    J. Complex.
  • 1995
The results of information-based complexity, see the book of Traub, Wasilkowski, and Wo?niakowski (1988, "Information-Based Complexity," Academic Press, New York/London), can be reconstructed in this model with only minor changes and two variants of stochastic algorithms are defined.

Quantum algorithms revisited

Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum

Complexity and information

This book explains the development of information-based complexity and some interesting topics include very high-dimensional integration and mathematical finance, and the curse of dimensionality.