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 ...
 D. Aharonov (1998): Quantum computation - a review. In: Annual Review of Computational Physics, World Scientific, volume VI, ed. Dietrich Stauffer, see also http://arXiv.org/abs/quant-ph/9812037.
 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 http://arXiv.org/abs/quant-ph/9802049.
 M. Boyer, P. Brassard, P. Høyer, and A. Tapp (1998): Tight bounds on quantum searching. Fortschritte der Physik 46, 493 - 505, see also http://arXiv.org/abs/quant-ph/9605034.
 G. Brassard, P. Høyer, M. Mosca, and A. Tapp (2000): Quantum amplitude amplification and estimation. Technical report, http://arXiv.org/abs/quantph/0005055.
 G. Brassard, P. Høyer, and A. Tapp (1998): Quantum counting. Lect. Notes in Comp. Science 1443, 820 - 831, see also http://arXiv.org/abs/quant-ph/9805082.
 D. Deutsch (1985): Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond., Ser. A 400, 97-117.
 A. Ekert, P. Hayden, and H. Inamori (2000): Basic concepts in quantum computation. See http://arXiv.org/abs/quant-ph/0011013.
 R. Feynman (1982): Simulating physics with computers. Int. J. Theor. Phys. 21, 467-488.
 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 http://arXiv.org/abs/quant-ph/9605043.
 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 http://arXiv.org/abs/quant-ph/9711043.