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. 244-258 2004 69 J. Comput. Syst. Sci. 2 http://dx.doi.org/10.1016/j.jcss.2004.02.002 db/journals/jcss/jcss69.html#BarnumS04