Robust Quantum Algorithms with $\eps$-Biased Oracles

Details Robust Quantum Algorithms with $\eps$-Biased Oracles Robust Quantum Algorithms with $\eps$-Biased Oracles

2006-05-08

arxiv.org/abs/quant-ph/0605077v1

Physics

Quantum Physics

To appear in COCOON'06

Scientific paper

This paper considers the quantum query complexity of {\it $\eps$-biased oracles} that return the correct value with probability only $1/2 + \eps$. In particular, we show a quantum algorithm to compute $N$-bit OR functions with $O(\sqrt{N}/{\eps})$ queries to $\eps$-biased oracles. This improves the known upper bound of $O(\sqrt{N}/{\eps}^2)$ and matches the known lower bound; we answer the conjecture raised by the paper by Iwama et al. affirmatively. We also show a quantum algorithm to cope with the situation in which we have no knowledge about the value of $\eps$. This contrasts with the corresponding classical situation, where it is almost hopeless to achieve more than a constant success probability without knowing the value of $\eps$.

Affiliated with

Also associated with

No associations

Rating

Robust Quantum Algorithms with $\eps$-Biased Oracles 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 Robust Quantum Algorithms with $\eps$-Biased Oracles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust Quantum Algorithms with $\eps$-Biased Oracles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-463775