arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0202142quant-ph
收藏

一种新的集成求和算法

New summing algorithm using ensemble computing

C. D'Helon, V. Protopopescu

摘要:

提出了一种集成算法,为函数样本集的评价和求和提供了一种新的途径。所提出的算法不是量子算法,在此范围内,它不涉及量子纠缠。该算法的查询复杂度仅取决于测量灵敏度与不同自旋子系综的数量的比例。从实际的角度来看,所提出的算法可能会导致指数加速,相比已知的量子和经典的求和算法。然而,通常,仅当函数样本的总数低于取决于测量灵敏度的阈值时,才存在该优点。

英文摘要:

We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query complexity of the algorithm depends only on the scaling of the measurement sensitivity with the number of distinct spin sub-ensembles. From a practical point of view, the proposed algorithm may result in an exponential speedup, compared to known quantum and classical summing algorithms. However in general, this advantage exists only if the total number of function samples is below a threshold value which depends on the measurement sensitivity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑