A better lower bound for quantum algorithms searching an ordered list

Andris Ambainis

REVIEW

A better lower bound for quantum algorithms searching an ordered list

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/9902053 v1 pith:JY6BOBYD submitted 1999-02-14 quant-ph cs.CCcs.DS

Andris Ambainis This is my paper

classification quant-phcs.CCcs.DS

keywords quantumalgorithmslistlowerorderedquant-phsearchingachieve

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We 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).

Discussion (0). Sign in to comment.

Pith tools