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

7 citations · 7 across the 1 of their papers we have counts for

collaborators

1 paper

quant-ph2005★ 7 cited

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

Pascal Koiran, Vincent Nesme, Natacha Portier

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 prob…