Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity

In communication complexity the input of a function f : X × Y → Z is distributed between two players Alice and Bob. If Alice knows only x ∈ X and Bob only y ∈ Y , how much information must Alice and Bob share to be able to elicit the value of f (x, y)? Do we need ℓ more resources to solve ℓ instances of a problem? This question is the direct sum question and has been studied in many computational models. In this paper we focus on the case of 2party deterministic communication complexity and give a counterexample to the direct sum conjecture in its strongest form. To do so we exhibit a family of functions for which the complexity of solving ℓ instances is less than (1 -ϵ)ℓ times the complexity of solving one instance for some small enough ϵ > 0. We use a customised method in the analysis of our family of total functions, showing that one can force the alternation of rounds between players. This idea allows us to exploit the integrality of the complexity measure to create an increasing gap between the complexity of solving the instances independently with that of solving them together.