The Internet Archive has a preservation copy of this work in our general collections.
The file type is
A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then our overall success probability will be exponentially small in k. We establish such theorems for the classical as well as quantum query complexity of the OR function. This implies slightly weaker direct product results for all total functions. We prove a similar result for quantum communication protocols computing k instancesarXiv:quant-ph/0402123v2 fatcat:zjptysi4afchxotkemro3wgake