A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity

Abstract

We study semidefinite relaxations of ${\hat{I}}_1$ combinatorial statements. By relaxing the pigeonhole principle, we obtain a new "quantum" pigeonhole principle which is a stronger statement. By relaxing statements of the form "the communication complexity of $f$ is $>k$", we obtain new communication models, which we call "${\hat{I}}_2^3$ communication" and "quantum-lab protocols". We prove, via an argument from proof complexity, that any natural model obtained by such a relaxation must solve all Karchmer--Wigderson games efficiently. However, the argument is not constructive, so we work to explicitly construct such protocols in these two models.