Explicit relation between all lower bound techniques for quantum query complexity

Loïck Magnin, Jérémie Roland. Explicit relation between all lower bound techniques for quantum query complexity. In Natacha Portier, Thomas Wilke, editors, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany. Volume 20 of LIPIcs, pages 434-445, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. [doi]

Abstract

Abstract is missing.