An information-theoretic analysis of Grover's algorithm

Simple item page
dc.creatorArikan, Erdal
dc.date2002-10-10
dc.date2002-10-11
dc.date.accessioned2026-07-07T06:05:12Z
dc.date.available2026-07-07T06:05:12Z
dc.descriptionGrover 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.
dc.description8 pages, 1 figure, minor corrections
dc.identifierhttps://arxiv.org/abs/quant-ph/0210068
dc.identifierhttp://arxiv.org/abs/quant-ph/0210068
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90557
dc.subjectQuantum Physics
dc.titleAn information-theoretic analysis of Grover's algorithm
dc.typetext

Files

Collections

arXiv