A better lower bound for quantum algorithms searching an ordered list

Simple item page
dc.creatorAmbainis, Andris
dc.date1999-02-14
dc.date.accessioned2026-07-07T06:16:12Z
dc.date.available2026-07-07T06:16:12Z
dc.descriptionWe show that any quantum algorithm searching an ordered list of n elements needs to examine at least 1/12 log n-O(1) of them. Classically, log n queries are both necessary and sufficient. This shows that quantum algorithms can achieve only a constant speedup for this problem. Our result improves lower bounds of Buhrman and de Wolf(quant-ph/9811046) and Farhi, Goldstone, Gutmann and Sipser (quant-ph/9812057).
dc.description10 pages, LaTeX
dc.identifierhttps://arxiv.org/abs/quant-ph/9902053
dc.identifierhttp://arxiv.org/abs/quant-ph/9902053
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93984
dc.subjectQuantum Physics
dc.subjectComputational Complexity
dc.subjectData Structures and Algorithms
dc.titleA better lower bound for quantum algorithms searching an ordered list
dc.typetext

Files

Collections

arXiv