A quantum lower bound for the query complexity of Simon's problem

Details A quantum lower bound for the query complexity of Simon's problem A quantum lower bound for the query complexity of Simon's problem

2005-01-12

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

Physics

Quantum Physics

8 pages, 1 figure

Scientific paper

Simon in his FOCS'94 paper was the first to show an exponential gap between classical and quantum computation. The problem he dealt with is now part of a well-studied class of problems, the hidden subgroup problems. We study Simon's problem from the point of view of quantum query complexity and give here a first nontrivial lower bound on the query complexity of a hidden subgroup problem, namely Simon's problem. Our bound is optimal up to a constant factor.

Affiliated with

Also associated with

No associations

Rating

A quantum lower bound for the query complexity of Simon's problem 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 quantum lower bound for the query complexity of Simon's problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A quantum lower bound for the query complexity of Simon's problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180009