arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.14870cs.CCquant-ph
收藏

分布测试的量子通信复杂度

Quantum Communication Complexity of Distribution Testing

Aleksandrs Belovs, Arturo Castellanos, François Le Gall, Guillaume Malod, Alexander A. Sherstov

AI总结:

本文研究分布接近性测试的量子通信复杂度,证明在低$l_2$范数下量子协议达到$\ ilde{O}(n/(tε^2))$量子比特,较经典结果有二次改进,并给出匹配下界。

摘要:

Andoni、Malkin和Nosatzki(ICALP'19)最近研究了离散分布接近性测试的经典通信复杂度。在该问题中,两个参与者各自从$[n]$上的一个分布接收$t$个样本,目标是判定他们的两个分布是否相等,或者是否在$l_1$距离上$ε$-远离。在本文中,我们证明了当分布具有低$l_2$范数时,该问题的量子通信复杂度为$\ ilde{O}(n/(tε^2))$量子比特,这比Andoni、Malkin和Nosatzki获得的经典通信复杂度有二次改进。我们还通过使用模式矩阵方法获得了匹配的下界。需要强调的是,每个参与者接收的样本是经典的,只有他们之间的通信是量子的。因此,我们的结果为量子协议在具有纯经典样本的测试问题中超越经典协议提供了一个场景。

英文摘要:

The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over $[n]$, and the goal is to decide whether their two distributions are equal, or are $ε$-far apart in the $l_1$-distance. In the present paper we show that the quantum communication complexity of this problem is $\tilde{O}(n/(tε^2))$ qubits when the distributions have low $l_2$-norm, which gives a quadratic improvement over the classical communication complexity obtained by Andoni, Malkin and Nosatzki. We also obtain a matching lower bound by using the pattern matrix method. Let us stress that the samples received by each of the parties are classical, and it is only communication between them that is quantum. Our results thus give one setting where quantum protocols overcome classical protocols for a testing problem with purely classical samples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑