论文标题
用于量子搜索的最佳算法
An Optimum Algorithm for Quantum Search
论文作者
论文摘要
本文讨论了格罗弗（Grover）算法的搜索算法的改进，而目标状态正在敲打重量本征态和未订购搜索空间。结果表明，在这些条件下，搜索效率取决于目标状态的二进制字符串的0和1的较小数，而Grover的算法可以在0和数字1不相等时提高Grover的算法。特别是，当相对于二进制字符串长度相对于1个数量，1个数量很小时，改进可能是指数的。一个有趣的应用是，在Grover的算法中，Dicke状态制备在所有情况下都可以使多效效率。对于决策过程，这种改进不会提高计算效率，但可以使实施更加简单。
This paper discusses an improvement to Grover's algorithm for searches where target states are Hamming weight eigenstates and search space is not ordered. It is shown that under these conditions search efficiency depends on the smaller number of 0's and 1's, not the total length, of binary string of target state, and that Grover's algorithm can be improved whenever number of 0's and number 1's are not equal. In particular, improvement can be exponential when number of 0's or number of 1's is very small relative to binary string length. One interesting application is that Dicke state preparation, which in Grover's algorithm is P on average, can be made poly-efficient in all cases. For decision making process, this improvement won't improve computation efficiency, but can make implementation much simpler.
