Quantum Search in an Ordered List via Adaptive Learning

Details Quantum Search in an Ordered List via Adaptive Learning Quantum Search in an Ordered List via Adaptive Learning

2007-03-24

arxiv.org/abs/quant-ph/0703231v2

Physics

Quantum Physics

10 pages no figures

Scientific paper

We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: 1. Each comparison can be erroneous with some probability $1 - p$. 2. At each stage $k$ comparisons can be performed in parallel and a noisy answer is returned We present a (classic) algorithm which optimally solves both variants together, up to an additive term of O(\log \log(n)), and prove matching information theoretic lower bounds. We use the algorithm to improve the results of Farhi et al \cite{FGGS99} presenting a quantum (error free) search algorithm in an ordered list of expected complexity less than (\log_2n) / 3.

Affiliated with

Also associated with

No associations

Rating

Quantum Search in an Ordered List via Adaptive Learning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Search in an Ordered List via Adaptive Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Search in an Ordered List via Adaptive Learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703401