Effects of Noisy Oracle on Search Algorithm Complexity
量子物理
2009-11-10 v2
摘要
Grover's algorithm provides a quadratic speed-up over classical algorithms for unstructured database or library searches. This paper examines the robustness of Grover's search algorithm to a random phase error in the oracle and analyzes the complexity of the search process as a function of the scaling of the oracle error with database or library size. Both the discrete- and continuous-time implementations of the search algorithm are investigated. It is shown that unless the oracle phase error scales as O(N^(-1/4)), neither the discrete- nor the continuous-time implementation of Grover's algorithm is scalably robust to this error in the absence of error correction.
引用
@article{arxiv.quant-ph/0304138,
title = {Effects of Noisy Oracle on Search Algorithm Complexity},
author = {Neil Shenvi and Kenneth R. Brown and K. Birgitta Whaley},
journal= {arXiv preprint arXiv:quant-ph/0304138},
year = {2009}
}
备注
16 pages, 4 figures, submitted to Phys. Rev. A