A strong direct product theorem (SDPT) states that solving n instances of a problem requires \Omega(n) times the resources for a single instance, even to achieve success probability 2^{-\Omega(n)}. We prove that quantum communication complexity obeys an SDPT whenever the communication lower bound for a single instance is proved by ... more >>>