A lower bound on the quantum query complexity of read-once functions

Howard Barnum, Michael E. Saks. A lower bound on the quantum query complexity of read-once functions. Electronic Colloquium on Computational Complexity (ECCC), (002), 2002. [doi]

Abstract

Abstract is missing.