89 citations
2 papers
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…
nlin.CG2004★ 89 cited
An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata
Nazim A. Fates, Michel Morvan
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classic…