Problem
Research questions and friction points this paper is trying to address.
randomized communication complexity
constant-round quantum communication complexity
total function
Constant-round quantum advantage in communication complexity for total functions
🤖 AI Summary
研究展示了一种总函数，其随机通信复杂度与常数轮量子通信复杂度之间存在多项式差距，此前仅知多项式轮次量子协议有此差异。
📝 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.
Innovation
Methods, ideas, or system contributions that make the work stand out.
total function
communication complexity
quantum advantage
constant-round
🔎 Similar Papers
No similar papers found.
