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

Journal of Complexity

Volumn 21, Issue 5, 2005, Pages 740-756

  Kacewicz, Bolesław ^a  

^a AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Poland)

Author keywords

Complexity; Initial value problems; Randomized and quantum algorithms

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS; INITIAL VALUE PROBLEMS; INTEGRATION; PROBLEM SOLVING; RANDOM PROCESSES;

COMPLEXITY; QUANTUM COMPLEXITY; RANDAOMIZED AND QUANTUM ALGORITHMS; SCALAR AUTONOMOUS PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 27144489692     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2005.05.003     Document Type: Article

References (12)

1. G. Brassard, P. Høyer, M. Mosca, A. Tapp, Quantum amplitude amplification and estimation, 2000, http://arXiv.org/abs/quant-ph/0005055.
2. R.P. Brent A class of optimal-order zero-finding methods using derivative evaluations J.F. Traub Analytic Computational Complexity 1976 Academic Press New York 59 73
3. S. Heinrich Quantum summation with an application to integration J. Complexity 18 2002 1 50
4. S. Heinrich, Quantum approximation I. Embeddings of finite dimensional L p spaces, J. Complexity 20 (2004) 5-26; see also http://arXiv.org/abs/quant-ph/ 0305030.
5. S. Heinrich, Quantum approximation II. Sobolev embeddings, J. Complexity 20 (2004) 27-45; see also http://arXiv.org/abs/quant-ph/0305031.
6. S. Heinrich, E. Novak, Optimal summation and integration by deterministic, randomized, and quantum algorithms, in: K.-T. Fang, F.J. Hickernell, H. Niederreiter (Eds.), Monte Carlo and Quasi-Monte Carlo Methods 2000, Springer, Berlin, 2002, pp. 50-62; see also http://arXiv.org/abs/quant-ph/ 0105114.
7. B. Kacewicz How to increase the order to get minimal-error algorithms for systems of ODEs Numer. Math. 45 1984 93 104
8. B. Kacewicz, Randomized and quantum algorithms yield a speed-up for initial-value problems, J. Complexity 20 (2004) 821-834; see also http://arXiv.org/abs/quant-ph/0311148.
9. A. Nayak, F. Wu, The quantum query complexity of approximating the median and related statistics, STOC, May 1999, pp. 384-393; see also http://arXiv.org/abs/quant-ph/9804066.
10. E. Novak, Deterministic and Stochastic Error Bounds in Numerical Analysis, Lecture Notes in Mathematics, vol. 1349, Springer, Berlin, 1988.
11. E. Novak, Quantum complexity of integration, J. Complexity 17 (2001) 2-16; see also http://arXiv.org/abs/quant-ph/0008124.
12. J.F. Traub, H. Woźniakowski, Path integration on a quantum computer, Quantum Inform. Process. 1 (5) (2003) 365-388; see also http://arXiv.org/abs/quant-ph/0109113.