A strong direct product theorem for quantum query complexity

Details A strong direct product theorem for quantum query complexity A strong direct product theorem for quantum query complexity

2011-04-22

arxiv.org/abs/1104.4468v3

Physics

Quantum Physics

V2: 19 pages (various additions and improvements, in particular: improved parameters in the main theorems due to a finer analy

Scientific paper

We show that quantum query complexity satisfies a strong direct product theorem. This means that computing $k$ copies of a function with less than $k$ times the quantum queries needed to compute one copy of the function implies that the overall success probability will be exponentially small in $k$. For a boolean function $f$ we also show an XOR lemma---computing the parity of $k$ copies of $f$ with less than $k$ times the queries needed for one copy implies that the advantage over random guessing will be exponentially small. We do this by showing that the multiplicative adversary method, which inherently satisfies a strong direct product theorem, is always at least as large as the additive adversary method, which is known to characterize quantum query complexity.

Affiliated with

Also associated with

No associations

Rating

A strong direct product theorem for quantum query complexity 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 A strong direct product theorem for quantum query complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A strong direct product theorem for quantum query complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330938