Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
This work establishes the first lower bound on quantum communication complexity without shared entanglement when entanglement-assisted communication is zero, resolving a fundamental question in quantum communication complexity.
The authors present relation problems that can be solved with zero communication in entanglement-assisted quantum communication models but require Ω(n) qubit communication without shared entanglement, achieving the maximum possible separation. This refutes a quantum analog of Newman's theorem.
We present relation problems whose input size is $n$ such that they can be solved with no communication for entanglement-assisted quantum communication models, but require $Ω(n)$ qubit communication for $2$-way quantum communication models without prior shared entanglement. This is the maximum separation of quantum communication complexity with and without shared entanglement. To our knowledge, our result even shows the first lower bound on quantum communication complexity without shared entanglement when the upper bound of entanglement-assisted quantum communication models is zero. Our result refutes a quantum analog of Newman's theorem. The problem we consider is parallel repetition of any non-local game which has a perfect quantum strategy and no perfect classical strategy, and for which a parallel repetition theorem holds with exponential decay.