| QUANTUM COMPLEXITY OF THE APPROXIMATION FOR THE CLASSES B（Wpr（[0, 1）d）） AND B（Hpr（[0, 1]d）） |
| |
| 作者姓名： | 叶培新 胡晓菲 |
| |
| 作者单位： | [1]School of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071, China [2]College of Mathematical, Syracuse University, NY13210, USA |
| |
| 基金项目： | Supported by the Natural Science Foundation of China（10501026, 60675010, 10971251）. |
| |
| 摘 要： | We study the approximation of functions from anisotropic Sobolev classes B(W_p~r([0,1]~d)) and H¨older-Nikolskii classes B(W_p~r([0,1]~d)) in the L q([0,1] d) norm with q ≤ p in the quantum model of computation.We determine the quantum query complexity of this problem up to logarithmic factors.It shows that the quantum algorithms are significantly better than the classical deterministic or randomized algorithms.
|
| 关 键 词： | 健康状况 量子模型 复杂性 各向异性Sobolev类 近似值 函数逼近 随机算法 量子算法 |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
