output
20032009
most citedTesting bibliometric indicators by their prediction of scientists promotions

93 citations

researchers with a paper here
collaborating institutions
Showing 2005Show all

1 paper · 1 filter

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…