An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract)

Harumichi Nishimura, Tomoyuki Yamakami. An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract). In Jirí Fiala, Václav Koubek, Jan Kratochvíl, editors, Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings. Volume 3153 of Lecture Notes in Computer Science, pages 827-838, Springer, 2004. [doi]

Abstract

Abstract is missing.