Tractability of approximation for weighted Korobov spaces on classical and quantum computers

Foundations of Computational Mathematics

Volumn 4, Issue 2, 2004, Pages 121-156

  Novak, Erich ^a   Sloan, Ian H ^b   Woźniakowski, Henryk ^c,d  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c Department of Earth and Environmental Sciences   (United States)

^d UNIVERSITY OF WARSAW   (Poland)

Author keywords

Approximation; Korobov spaces; Quantum computation; Randomized algorithms; Tractability

Indexed keywords

KOROBOV SPACES; PERIODIC FUNCTIONS; QUANTUM COMPUTERS; TRACTABILITY;

ALGORITHMS; APPROXIMATION THEORY; COSTS; FUNCTIONS; POLYNOMIALS; QUANTUM THEORY;

PROBLEM SOLVING;

EID: 2642560407     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-002-0074-6     Document Type: Article

References (33)

1. J. An and A. Owen, Quasi-regression, J. Complexity 17 (2001), 588-607.
2. N. Aronszajn, Theory of reproducing kernels, Trans. Amer. Math. Soc. 68 (1950), 337-404.
3. R. Beals, H. Buhrman, R. Cleve, and M. Mosca, Quantum lower bounds by polynomials, in Proceedings of 39th IEEE FOCS, 1998, pp. 352-361. See also http://arXiv.org/abs/quant-ph/9802049.
4. G. Brassard, P. Høyer, M. Mosca, and A. Tapp, Quantum amplitude amplification and estimation, in Quantum Computation and Information (S. J. Lomonaco and H. E. Brandt, eds.), American Mathematical Society, Providence, RI, 2002. See also http://arXiv.org/abs/quant-ph/0005055.
5. A. Ekert, P. Hayden, and H. Inamori (2000), Basic concepts in quantum computation. See http://arXiv.org/abs/quant-ph/0011013.
6. L. Grover, A fast quantum mechanical algorithm for database search, in Proc. 28 Annual ACM Symp. on the Theory of Computing, ACM Press, New York, 1996, pp. 212-219. See also http://arXiv.org/abs/quant-ph/9605043.
7. L. Grover, A framework for fast quantum mechanical algorithms, in Proc. 30 Annual ACM Symp. on the Theory of Computing, ACM Press, New York, 1998, pp. 53-62. See also http://arXiv.org/abs/quant-ph/9711043.
8. J. Gruska, Quantum Computing, McGraw-Hill, London, 1999.
9. S. Heinrich, Quantum summation with an application to integration, J. Complexity 18 (2002), 1-50. See also http://arXiv.org/abs/quant-ph/0105116.
10. S. Heinrich, Quantum integration in Sobolev classes, J. Complexity 19 (2003), 19-42. See also http://arXiv.Org/abs/quant-ph/0112153.
11. S. Heinrich and E. Novak, Optimal summation and integration by deterministic, randomized, and quantum algorithms, in Monte Carlo and Quasi-Monte Carlo Methods 2000. (K.-T. Fang, F. J. Hickernell, and H. Niederreiter, eds.), Springer-Verlag, New York, 2000, pp. 50-62. See also http://arXiv.org/abs/quant-ph/0105114.
12. S. Heinrich and E. Novak, On a problem in quantum summation, J. Complexity 19 (2003), 1-18. See also http://arXiv.org/abs/quant-ph/0109038.
13. F. J. Hickernell and H. Woźniakowski, Integration and approximation in arbitrary dimensions, Adv. in Comput. Math. 12 (2000), 25-58.
14. F. J. Hickernell and H. Woźniakowski, Tractability of multivariate integration for periodic functions, J. Complexity 17 (2001), 660-682.
15. A. Nayak and F. Wu, The quantum query complexity of approximating the median and related statistics, STOC (May 1999), 384-393. See also http://arXiv.org/abs/quant-ph/9804066.
16. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000.
17. E. Novak, Optimal linear randomized methods for linear operators in Hubert spaces, J. Complexity 8 (1992), 22-36.
18. E. Novak, The real number model in numerical analysis, J. Complexity 11 (1995), 57-73.
19. E. Novak, Quantum complexity of integration, J. Complexity 17 (2001), 2-16. See also http://arXiv.org/abs/quant-ph/0008124.
20. E. Novak and H. Woźniakowski, When are integration and discrepancy tractable?, in FOCM Proceedings of Oxford 1999 (R. A. DeVore, A. Iserlis, and E. Süli, eds.), Cambridge University Press, Cambridge, 2001, pp. 211-266.
21. E. Novak and H. Woźniakowski, Complexity of linear problems with a fixed output basis, J. Complexity 16 (2000), 333-362.
22. E. Novak and H. Woźniakowski, Intractability results for integration and discrepancy, J. Complexity 17 (2001), 388-441.
23. A. O. Pittenger, Introduction to Quantum Computing Algorithms, Birkhäuser, Boston, 1999.
24. P. W. Shor, Introduction to Quantum Algorithms, See http://arXiv.org/abs/ quant-ph/quantph/0005003.
25. I. H. Sloan and H. Woźniakowski, When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? J. Complexity 14 (1998), 1-33.
26. I. H. Sloan and H. Woźniakowski, Tractability of multivariate integration for weighted Korobov classes, J. Complexity 17 (2001), 697-721.
27. J. F. Traub, G. W. Wasilkowski and H. Woźniakowski, Information-Based Complexity, Academic Press, New York, 1988.
28. J. F. Traub and H. Woźniakowski, Path integration on a quantum computer (submitted for publication). See also http://arXiv.org/abs/quant-ph/ 0109113.
29. G. Wahba, Spline Models for Observational Data, SIAM-NSF Regional Conference Series in Appl. Math., Vol. 59, SIAM, Philadelphia, 1990.
30. G. W. Wasilkowski and H. Woźniakowski, Weighted tensor product algorithms for linear multivariate problems, J. Complexity 15 (1999), 402-447.
31. G. W. Wasilkowski and H. Woźniakowski, On the power of standard information for weighted approximation, Found. Comput. Math. 1 (2001), 417-434.
32. H. Woźniakowski, Tractability and strong tractability of linear multivariate problems, J. Complexity 10 (1994), 96-128.
33. H. Woźniakowski, Efficiency of quasi-Monte Carlo algorithms for high dimensional integrals, in Monte Carlo and Quasi-Monte Carlo Methods 1998 (H. Niederreiter and J. Spanier, eds.), Springer-Verlag, Berlin, 1999, pp. 114-136.