量子数据库规模的一个内在限制
An intrinsic limitation on the size of quantum database
摘要：
结果发现，Grover的量子搜索算法对相位反转和Hadmard变换不准确是不鲁棒的。Grover量子搜索算法中的不完美相位反转和Hadmart-Walsh变换导致标记态的最大概率降低，影响算法的效率。即使在没有退相干的情况下。考虑到不准确的程度，我们发现，为了保证一半的成功率，数据库的大小应该在$O({1 \over δ^2})$的顺序，其中$δ$是不确定性。
英文摘要：
It is found that Grover's quantum search algorithm is not robust against phase inversion and Hadmard transformation inaccuracies. Imperfect phase inversions and Hadmard-Walsh transformations in Grover's quantum search algorithm lead to reductions in the maximum probability of the marked state and affect the efficiency of the algorithm. even in the absence of decoherence. Given the degrees of inaccuracies, we find that to guarantee half rate of success, the size of the database should be in the order of $O({1 \over δ^2})$, where $δ$ is the uncertainty.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
