Lower Bounds on Quantum Query Complexity

Details Lower Bounds on Quantum Query Complexity Lower Bounds on Quantum Query Complexity

2005-09-21

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

Bulletin of the European Association for Theoretical Computer Science, Volume 87, 2005

Physics

Quantum Physics

survey, 23 pages

Scientific paper

Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers_cannot_ do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare the methods.

Affiliated with

Also associated with

No associations

Rating

Lower Bounds on 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 Lower Bounds on Quantum Query Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds on Quantum Query Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486987