publication . Preprint . 2001

From Monte Carlo to Quantum Computation

Heinrich, Stefan;
Open Access English
  • Published: 23 Dec 2001
Quantum computing was so far mainly concerned with discrete problems. Recently, E. Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, which advantages quantum computing can bring over classical deterministic or randomized methods for this type of problem. In this paper we give a short introduction to the basic ideas of quantum computing and survey recent results on high dimensional integration. We discuss connections to the Monte Carlo methology and compare the optimal error rates of quantum algorithms to those of classical deterministic and randomized algorithms.
free text keywords: Quantum Physics
Download from
30 references, page 1 of 2

[1] D. Aharonov (1998): Quantum computation - a review. In: Annual Review of Computational Physics, World Scientific, volume VI, ed. Dietrich Stauffer, see also

[3] R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf (1998): Quantum lower bounds by polynomials. Proceedings of 39th IEEE FOCS, 352-361, see also [OpenAIRE]

[4] M. Boyer, P. Brassard, P. Høyer, and A. Tapp (1998): Tight bounds on quantum searching. Fortschritte der Physik 46, 493 - 505, see also

[5] G. Brassard, P. Høyer, M. Mosca, and A. Tapp (2000): Quantum amplitude amplification and estimation. Technical report, [OpenAIRE]

[6] G. Brassard, P. Høyer, and A. Tapp (1998): Quantum counting. Lect. Notes in Comp. Science 1443, 820 - 831, see also

[7] D. Deutsch (1985): Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond., Ser. A 400, 97-117.

[8] A. Ekert, P. Hayden, and H. Inamori (2000): Basic concepts in quantum computation. See [OpenAIRE]

[9] R. Feynman (1982): Simulating physics with computers. Int. J. Theor. Phys. 21, 467-488.

[10] L. Grover (1996): A fast quantum mechanical algorithm for database search. Proc. 28 Annual ACM Symp. on the Theory of Computing, 212-219, ACM Press New York. See also [OpenAIRE]

[11] L. Grover (1998): A framework for fast quantum mechanical algorithms. Proc. 30 Annual ACM Symp. on the Theory of Computing, 53-62, ACM Press New York. See also

[12] J. Gruska (1999): Quantum Computing. McGraw-Hill, London.

[13] S. Heinrich (1993): Random approximation in numerical analysis. In: K. D. Bierstedt, A. Pietsch, W. M. Ruess, and D. Vogt, editors, Functional Analysis, 123 - 171, Marcel Dekker.

[14] S. Heinrich (2001): Quantum summation with an application to integration. Journal of Complexity (to appear). See also

[15] S. Heinrich (2001): Quantum integration in Sobolev classes (in preparation).

[16] S. Heinrich and E. Novak (2001a): Optimal summation and integration by deterministic, randomized, and quantum algorithms. In: K.-T. Fang, F. J. Hickernell, and H. Niederreiter, editors, Monte Carlo and QuasiMonte Carlo Methods 2000, Springer-Verlag, Berlin (to appear), see also

30 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue