We exhibit a total search problem with classically verifiable solutions whose communication complexity in the quantum SMP model is exponentially smaller than in the classical two-way randomized model. Our problem is a bipartite version of a query complexity problem recently introduced by Yamakawa and Zhandry (JACM 2024). We prove the classical lower bound using the structure-vs-randomness paradigm for analyzing communication protocols.

翻译：我们展示了一个具有经典可验证解的总搜索问题，其在量子SMP模型中的通信复杂度相对于经典双向随机模型呈指数级降低。该问题是Yamakawa与Zhandry（JACM 2024）近期提出的查询复杂度问题的二分版本。我们通过分析通信协议的结构性与随机性范式证明了经典下界。