arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0511013quant-phcs.CC
收藏

通信复杂度中的有界误差量子态识别和指数分离

Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity

Dmytro Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf

摘要:

考虑有界误差量子态识别问题:给定态α_0或态α_1,要求输出“0”、“1”或“?'(“不知道”),这样以输出' 0'或' 1 '为条件,我们的猜测是正确的概率很高。目标是最大化不输出的可能性'?'.我们证明了一个直积定理:如果我们给出两个这样的问题,分别具有最优概率a和b,并且第一个问题中的状态是纯的,那么联合有界误差状态识别问题的最优概率是O(ab)。我们的证明是基于半定规划对偶,可能会有更广泛的兴趣。利用这一结果,我们提出了两个指数分离的同时消息传递模型的通信复杂性。这两个都是在最强烈的意义上表现出来的。首先,我们描述了一个关系,在存在共享随机性的情况下,可以用O(log n)个经典通信比特来计算,但是如果双方不共享随机性,即使通信是量子的,也需要Omega(n^{1/3})个通信。这显示了姚最近通过没有共享随机性的量子协议对共享随机性协议的指数模拟的最优性。其次,我们描述了一个关系,可以计算O(log n)经典位的通信存在共享纠缠,但需要Ω(n/log n)^{1/3})通信,如果各方共享随机性,但没有纠缠,即使通信是量子的。这是通信复杂性中的第一个例子,在这种情况下,纠缠比量子通信带来的好处要多得多。

英文摘要:

We consider the problem of bounded-error quantum state identification: given either state α_0 or state α_1, we are required to output `0', `1' or `?' ("don't know"), such that conditioned on outputting `0' or `1', our guess is correct with high probability. The goal is to maximize the probability of not outputting `?'. We prove a direct product theorem: if we're given two such problems, with optimal probabilities a and b, respectively, and the states in the first problem are pure, then the optimal probability for the joint bounded-error state identification problem is O(ab). Our proof is based on semidefinite programming duality and may be of wider interest. Using this result, we present two exponential separations in the simultaneous message passing model of communication complexity. Both are shown in the strongest possible sense. First, we describe a relation that can be computed with O(log n) classical bits of communication in the presence of shared randomness, but needs Omega(n^{1/3}) communication if the parties don't share randomness, even if communication is quantum. This shows the optimality of Yao's recent exponential simulation of shared-randomness protocols by quantum protocols without shared randomness. Second, we describe a relation that can be computed with O(log n) classical bits of communication in the presence of shared entanglement, but needs Omega((n/log n)^{1/3}) communication if the parties share randomness but no entanglement, even if communication is quantum. This is the first example in communication complexity of a situation where entanglement buys you much more than quantum communication does.

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

↑