Equality, Revisited

TL;DR

This paper introduces a new lower bound technique for the equality function in quantum-classical SMP models, establishing tight bounds and a unified analysis across various communication scenarios, revealing nuanced complexity differences.

Contribution

The paper develops a novel lower bound method that provides tight bounds for EQ and NE in quantum-classical SMP, unifying their analysis across multiple models.

Findings

Omega(√n) lower bounds for EQ and NE in quantum SMP

NE is easier than EQ with classical proofs, similar complexity with quantum proofs

Unified framework for analyzing EQ and NE in various SMP configurations

Abstract

We develop a new lower bound method for analysing the complexity of the Equality function (EQ) in the Simultaneous Message Passing (SMP) model of communication complexity. The new technique gives tight lower bounds of $\Omega(\sqrt n)$ for both EQ and its negation NE in the non-deterministic version of quantum-classical SMP, where Merlin is also quantum $-$ this is the strongest known version of SMP where the complexity of both EQ and NE remain high (previously known techniques seem to be insufficient for this). Besides, our analysis provides to a unified view of the communication complexity of EQ and NE, allowing to obtain tight characterisation in all previously studied and a few newly introduced versions of SMP, including all possible combination of either quantum or randomised Alice, Bob and Merlin in the non-deterministic case. Some of our results highlight that NE is easier than EQ in the presence of classical proofs, whereas the problems have (roughly) the same complexity when a quantum proof is present.