Adversary lower bounds for nonadaptive quantum algorithms

Details Adversary lower bounds for nonadaptive quantum algorithms Adversary lower bounds for nonadaptive quantum algorithms

2008-04-09

arxiv.org/abs/0804.1440v1

Dans proceedings of WoLLIC 2008 - WoLLIC 2008 15th Workshop on Logic, Language, Information and Computation, Edinburgh : Royau

Computer Science

Computational Complexity

Scientific paper

We present general methods for proving lower bounds on the query complexity
of nonadaptive quantum algorithms. Our results are based on the adversary
method of Ambainis.

Affiliated with

Also associated with

No associations

Rating

Adversary lower bounds for nonadaptive quantum algorithms 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 Adversary lower bounds for nonadaptive quantum algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adversary lower bounds for nonadaptive quantum algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-574617