On a problem in quantum summation

Journal of Complexity

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

  Heinrich, Stefan ^a   Novak, Erich ^b  

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

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037312749     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0885-064X(02)00003-1     Document Type: Review

References (19)

1. D.S. Abrams, C.P. Williams, Fast quantum algorithms for numerical integrals and stochastic processes, Technical Report, 1999, http://arXiv.org/abs/quant-ph/9908083.
2. R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, Proceedings of 39th IEEE FOCS, 1998, pp. 352-361, see also http://arXiv.org/abs/quant-ph/9802049.
3. G. Brassard, P. Høyer, M. Mosca, A. Tapp, Quantum amplitude amplification and estimation, Technical Report, 2000, http://arXiv.org/abs/quant-ph/0005055.
4. A. Ekert, P. Hayden, H. Inamori, Basic concepts in quantum computation, 2000, see http://arXiv.org/abs/quant-ph/0011013.
5. L. Grover, A fast quantum mechanical algorithm for database search, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, ACM Press, New York, 1996, pp. 212-219, see also http://arXiv.org/abs/quant-ph/9605043.
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, Quantum summation with an application to integration, J. Complexity 18 (2002) 1-50, see also http://arXiv.org/abs/quant-ph/0105116.
9. S. Heinrich, Quantum integration in Sobolev classes, J. Complexity 19 (2003) 19-42, see also http://arXiv.org/abs/quant-ph/0112153.
10. 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.
11. 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.
12. M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000.
13. E. Novak, Deterministic and Stochastic Error Bounds in Numerical Analysis, Lecture Notes in Mathematics, Vol. 1349, Springer, Berlin, 1988.
14. E. Novak, The real number model in numerical analysis, J Complexity 11 (1995) 57-73.
15. E. Novak, Quantum complexity of integration, J. Complexity 17 (2001) 2 16, see also http://arXiv.org/abs/quant-ph/0008124.
16. A.O. Pittenger, Introduction to Quantum Computing Algorithms, Birkhäuser, Boston, 1999.
17. P.W. Shor, Introduction to Quantum Algorithms, 2000, see http://arXiv.org/abs/quant-ph/0005003.
18. J.F. Traub, H. Woźniakowski, Path integration on a quantum computer, 2001, see http://arXiv.org/abs/quant-ph/0109113.
19. J.F. Traub, G.W. Wasilkowski, H. Woźniakowski, Information-Based Complexity, Academic Press, New York, 1988.