Physics – Quantum Physics
Scientific paper
2004-10-18
Physics
Quantum Physics
20 pages
Scientific paper
The Feynman-Kac path integration problem was studied in the worst case setting by Plaskota et al. (J. Comp. Phys. 164 (2000) 335) for the univariate case and by Kwas and Li (J. Comp. 19 (2003) 730) for the multivariate case with d space variables. In this paper we consider the multivariate Feynman-Kac path integration problem in the randomized and quantum settings. For smooth multivariate functions, it was proven in Kwas and Li (2003) that the classical worst case complexity suffers from the curse of dimensionality in d. We show that in both the randomized and quantum settings the curse of dimensionality is vanquished, i.e., the number of function evaluations and/or quantum queries required to compute an e-approximation has a bound independent of d and depending polynomially on 1/e. The exponents of these polynomials are at most 2 in the randomized setting and at most 1 in the quantum setting. Hence we have exponential speedup over the classical worst case setting and quadratic speedup of the quantum setting over the randomized setting. However, both the randomized and quantum algorithms presented here still require extensive precomputing, similar to the algorithms of Plaskota et al. (2000) and Kwas and Li(2003).
No associations
LandOfFree
Complexity of multivariate Feynman-Kac path integration in randomized and quantum settings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Complexity of multivariate Feynman-Kac path integration in randomized and quantum settings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of multivariate Feynman-Kac path integration in randomized and quantum settings will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-399389