中文

On a Problem in Quantum Summation

量子物理 2013-04-16 v1 数值分析

摘要

We consider the computation of the mean of sequences in the quantum model of computation. We determine the query complexity in the case of sequences which satisfy a pp-summability condition for 1p<21\le p<2. This settles a problem left open in Heinrich (2001).

引用

@article{arxiv.quant-ph/0109038,
  title  = {On a Problem in Quantum Summation},
  author = {Stefan Heinrich and Erich Novak},
  journal= {arXiv preprint arXiv:quant-ph/0109038},
  year   = {2013}
}

备注

21 pages, paper submitted to the Journal of Complexity