7 citations · 8 across the 2 of their papers we have counts for
Showing quant-phShow all
2 papers · 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…
quant-ph2003★ 1 cited
Decidable and undecidable problems about quantum automata
Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran +1
We study the following decision problem: is the language recognized by a quantum finite automaton empty or non-empty? We prove that this problem is decidable or undecidable dependi…