有序表插入量子计算速度的一个极限
A Limit on the Speed of Quantum Computation for Insertion into an Ordered List
摘要：
我们考虑的问题，插入一个新的项目到一个有序列表的N-1个项目。算法的长度是通过它在新项和列表中已有项之间进行比较的次数来衡量的。传统上，确定插入点需要log N次比较。我们表明，对于N大，没有量子算法可以减少比较的数量低于log N/（2 loglog N）。
英文摘要：
We consider the problem of inserting a new item into an ordered list of N-1 items. The length of an algorithm is measured by the number of comparisons it makes between the new item and items already on the list. Classically, determining the insertion point requires log N comparisons. We show that, for N large, no quantum algorithm can reduce the number of comparisons below log N/(2 loglog N).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
