On the quantum communication complexity of total functions
arXiv:2608.18784
Abstract
We present a total function with a polylogarithmic two-message quantum protocol, whereas every randomised protocol, even with arbitrarily many rounds, requires polynomial communication.
Preliminary version