We study the approximation of the integration of multivariate functions in the quantum model of computation. Using a new reduction approach we obtain a lower bound of the n-th minimal query error on anisotropic Sobole...We study the approximation of the integration of multivariate functions in the quantum model of computation. Using a new reduction approach we obtain a lower bound of the n-th minimal query error on anisotropic Sobolev class R（Wpr（[0, 1]d）） （r R＋d）. Then combining this result with our previous one we determine the optimal bound of n-th minimal query error for anisotropic Hblder- Nikolskii class R（H∞r（[0,1]d）） and Sobolev class R（W∞r（[0,1]d））. The results show that for these two types of classes the quantum algorithms give significant speed up over classical deterministic and randomized algorithms.展开更多
基金Supported by National Natural Science Foundation of China (Grant Nos. 10501026 and 60675010)
文摘We study the approximation of the integration of multivariate functions in the quantum model of computation. Using a new reduction approach we obtain a lower bound of the n-th minimal query error on anisotropic Sobolev class R（Wpr（[0, 1]d）） （r R＋d）. Then combining this result with our previous one we determine the optimal bound of n-th minimal query error for anisotropic Hblder- Nikolskii class R（H∞r（[0,1]d）） and Sobolev class R（W∞r（[0,1]d））. The results show that for these two types of classes the quantum algorithms give significant speed up over classical deterministic and randomized algorithms.
