Constant-round quantum advantage in communication complexity for total functions

Abstract:We show that there exists a total function for which there is a polynomial gap between the randomized and the constant-round quantum communication complexity. Previously, such a separation was known only for quantum protocols using polynomially many rounds.

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

arXiv:2608.19787 [quant-ph]

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

https://doi.org/10.48550/arXiv.2608.19787 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.