A new quantum lower bound method, with an application to strong direct product theorem for quantum search

Details A new quantum lower bound method, with an application to strong direct product theorem for quantum search A new quantum lower bound method, with an application to strong direct product theorem for quantum search

2005-08-26

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

Physics

Quantum Physics

20 pages, v2 typos corrected

Scientific paper

We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of adversary method, by analyzing the eigenspace structure of the problem. Using the new method, we prove a strong direct product theorem for quantum search. This result was previously proven by Klauck, Spalek and de Wolf (quant-ph/0402123) using polynomials method. No proof using adversary method was known before.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-24806