Speed from Repetition

Details Speed from Repetition Speed from Repetition

2011-01-04

arxiv.org/abs/1101.0798v1

Physics

Quantum Physics

7 pages, 3 figures

Scientific paper

We present an oracle problem, which we call the Repeated Randomness problem, that a quantum algorithm can solve in one query, while any classical algorithm requires $\Omega(\log n)$ queries, where the oracle function has $2^n$ inputs. This problem has connections to the parity problem introduced by Bernstein and Vazirani \cite{Bernstein1993} and to a variation of the NAND tree described by Zhan et al \cite{Zhan}.

Affiliated with

Also associated with

No associations

Rating

Speed from Repetition 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 Speed from Repetition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Speed from Repetition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-75432