Improved Separations between Quantum and Classical Communication Complexity of Total Functions

Abstract:We refine Gavinsky's framework (arXiv:2608.18784) for exponential separations between quantum and randomized communication complexity of total functions and obtain larger separations: polylogarithmic quantum communication versus $\tilde\Omega(\sqrt n)$ randomized communication with two quantum messages, and versus $\Omega(n^{1-\varepsilon})$ for every fixed $0<\varepsilon<1$ with more quantum messages.

Quantum Physics (quant-ph); Computational Complexity (cs.CC)

arXiv:2609.16726 [quant-ph]

(or arXiv:2609.16726v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.16726 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.