Pascal Koiran, Vincent Nesme, Natacha Portier. A Quantum Lower Bound for the Query Complexity of Simon s Problem. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings. Volume 3580 of Lecture Notes in Computer Science, pages 1287-1298, Springer, 2005. [doi]
Abstract is missing.