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

@article{Kacewicz2005ImprovedBO,
  title={Improved bounds on the randomized and quantum complexity of initial-value problems},
  author={Boleslaw Z. Kacewicz},
  journal={J. Complex.},
  year={2005},
  volume={21},
  pages={740-756}
}
  • B. Kacewicz
  • Published 4 May 2004
  • Computer Science, Mathematics
  • J. Complex.

The randomized complexity of initial value problems

Almost optimal solution of initial-value problems by randomized and quantum algorithms

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

The Quantum Setting with Randomized Queries for Continuous Problems

TLDR
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.

On the Complexity of Searching for a Maximum of a Function on a Quantum Computer

  • Maciej Gocwin
  • Computer Science, Mathematics
    Quantum Inf. Process.
  • 2006
TLDR
It is shown that quantum computation yields a quadratic speed-up over deterministic and randomized algorithms.

Numerical Analysis on a Quantum Computer

TLDR
Having matching upper and lower complexity bounds for the quantum setting, this work is in a position to assess the possible speedups quantum computation could provide over classical deterministic or randomized algorithms for these numerical problems.

Tractability of Multivariate Problems

TLDR
The main purpose of this book is to study weighted spaces and to obtain conditions on the weights that are necessary and sufficient to achieve various notions of tractability, depending on how to measure the lack of exponential dependence.

Adaptive Itô-Taylor algorithm can optimally approximate the Itô integrals of singular functions

Finding Solutions of the Navier‐Stokes Equations through Quantum Computing—Recent Progress, a Generalization, and Next Steps Forward

  • F. Gaitan
  • Physics
    Advanced Quantum Technologies
  • 2021
Efficient simulation of a quantum system's dynamics is expected to be an important application area for quantum computers as existing classical computers cannot do this. However, quantum systems are

Qubit complexity of continuous problems

TLDR
It is shown how to obtain the classical query complexity for continuous problems and a simple formula is established for a lower bound on the qubit complexity in terms of the Classical query complexity.

Finding flows of a Navier–Stokes fluid through quantum computing

TLDR
This work presents a quantum algorithm for solving the Navier–Stokes nonlinear partial differential equations, and points to a large new application area for quantum computing with substantial economic impact, including the trillion-dollar aerospace industry, weather-forecasting, and engineered-plasma technologies.

References

SHOWING 1-10 OF 13 REFERENCES

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

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

Quantum Complexity of Integration

  • E. Novak
  • Computer Science, Mathematics
    J. Complex.
  • 2001
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

Quantum Summation with an Application to Integration

TLDR
Developing quantum algorithms for computing the mean of sequences that satisfy a p-summability condition and for integration of functions from Lebesgue spaces Lp(0, 1]d, and proving lower bounds showing that the proposed algorithms are, in many cases, optimal within the setting of quantum computing.

Path Integration on a Quantum Computer

TLDR
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.

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 Holder or Sobolev spaces. First we discuss optimal deterministic and

The quantum query complexity of approximating the median and related statistics

TLDR
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 approximation II. Sobolev embeddings

  • S. Heinrich
  • Computer Science, Mathematics
    J. Complex.
  • 2004

Quantum approximation I. Embeddings of finite-dimensional Lp spaces

  • S. Heinrich
  • Mathematics, Computer Science
    J. Complex.
  • 2004

How to increase the order to get minimal-error algorithms for systems of ODE

TLDR
The Taylor-integral algorithm is defined which has the error of ordern−(r+1) which is minimal among all algorithms which usen linear or nonlinear smooth functionals off, in the class of bounded functionsf with bounded partial derivatives up to orderr.

A CLASS OF OPTIMAL-ORDER ZERO-FINDING METHODS USING DERIVATIVE EVALUATIONS