An information-theoretic analysis of Grover's algorithm
量子物理
2007-05-23 v2
摘要
Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately square-root of N queries to a quantum oracle, thus achieving a square-root speed-up over classical algorithms. We present an information-theoretic analysis of Grover's algorithm and show that the square-root speed-up is the best attainable result using Grover's oracle.
引用
@article{arxiv.quant-ph/0210068,
title = {An information-theoretic analysis of Grover's algorithm},
author = {Erdal Arikan},
journal= {arXiv preprint arXiv:quant-ph/0210068},
year = {2007}
}
备注
8 pages, 1 figure, minor corrections