Quantum integration in Sobolev classes

Journal of Complexity

Volumn 19, Issue 1, 2003, Pages 19-42

  Heinrich, Stefan ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037315228     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0885-064X(02)00008-0     Document Type: Review

References (22)

1. R.A. Adams, Sobolev Spaces, Academic Press, New York, 1975.
2. D. Aharonov, Quantum computation-a review, in: D. Stauffer (Ed.), Annual Review of Computational Physics, vol. VI, World Scientific, Singapore, 1998, see also http://arXiv.org/abs/quant-ph/9812037.
3. G. Brassard, P. Høyer, M. Mosca, A. Tapp, Quantum amplitude amplification and estimation, 2000, see http://arXiv.org/abs/quant-ph/0005055.
4. P.G. Ciarlet, The Finite Element Method for Elliptic Problems, North-Holland, Amsterdam, 1978.
5. A. Ekert, P. Hayden, H. Inamori, Basic concepts in quantum computation, 2000, see http://arXiv.org/abs/quant-ph/0011013.
6. L. Grover, A framework for fast quantum mechanical algorithms, Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, ACM Press, New York, 1998, pp. 53-62, see also http://arXiv.org/abs/quant-ph/9711043.
7. J. Gruska, Quantum Computing, McGraw-Hill, London, 1999.
8. S. Heinrich, Random approximation in numerical analysis, in: K.D. Bierstedt, A. Pietsch, W.M. Ruess, D. Vogt (Eds.), Functional Analysis, Marcel Dekker, New York, 1993, pp. 123-171.
9. S. Heinrich, From Monte Carlo to quantum computation, in: K. Entacher, W.Ch. Schmid, A. Uhl, (Guest Eds.) Proceedings of the Third IMACS Seminar on Monte Carlo Methods MCM2001, Salzburg 2001, Special Issue of Mathematics and Computers in Simulation, to appear.
10. S. Heinrich, Quantum summation with an application to integration, J. Complexity 18 (2002) 1-50, see also http://arXiv.org/abs/quant-ph/0105116.
11. S. Heinrich, E. Novak, On a problem in quantum summation, J. Complexity 19 (2003) 1-18, see also http://arXiv.org/abs/quant-ph/0109038.
12. 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.
13. 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.
14. M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000.
15. E. Novak, Deterministic and Stochastic Error Bounds in Numerical Analysis, Lecture Notes in Mathematics, vol. 1349, Springer, Berlin, 1998.
16. E. Novak, Quantum complexity of integration, J. Complexity 17 (2001) 2-16, see also http://arXiv.org/abs/quant-ph/0008124.
17. A.O. Pittenger, Introduction to Quantum Computing Algorithms, Birkhäuser, Boston, 1999.
18. P.W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 121-131, see also http://arXiv.org/abs/quant-ph/9508027.
19. P.W. Shor, Introduction to quantum algorithms, 2000, see http://arXiv.org/abs/quant-ph/0005003.
20. J.F. Traub, H. Woźniakowski, Path integration on a quantum computer, 2001, see http://arXiv.org/abs/quant-ph/0109113.
21. J.F. Traub, G.W. Wasilkowski, H. Woźniakowski, Information-Based Complexity, Academic Press, New York, 1988.
22. H. Triebel, Interpolation Theory, Function Spaces, Differential Operators, 2nd Edition, Barth, Leipzig, 1995.