7 citations · 9 across the 2 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2007★ 2 cited
One-dimensional quantum cellular automata over finite, unbounded configurations
Pablo Arrighi, Vincent Nesme, Reinhard Werner
One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-…
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…