Problem
Research questions and friction points this paper is trying to address.
Quantum Communication Complexity
Classical Communication Complexity
Total Functions
Improved Separations between Quantum and Classical Communication Complexity of Total Functions
🤖 AI Summary
本文通过改进Gavinsky框架，实现量子与经典通信复杂度间更大分离，使用对数级量子通信对抗多项式级经典通信。
📝 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Ω(\sqrt n)$ randomized communication with two quantum messages, and versus $Ω(n^{1-\varepsilon})$ for every fixed $0<\varepsilon<1$ with more quantum messages.
Innovation
Methods, ideas, or system contributions that make the work stand out.
quantum communication
randomized communication
communication complexity
exponential separations
🔎 Similar Papers
No similar papers found.
