期刊
THEORETICAL COMPUTER SCIENCE
卷 287, 期 1, 页码 337-353出版社
ELSEVIER
DOI: 10.1016/S0304-3975(02)00377-8
关键词
quantum computing; communication complexity
In the setting of communication complexity, two distributed parties want to compute a function depending on both their inputs, using as little communication as possible. The required communication can sometimes be significantly lowered if we allow the parties the use of quantum communication. We survey the main results of the young area of quantum communication complexity: its relation to teleportation and dense coding, the main examples of fast quantum communication protocols, lower bounds, and some applications. (C) 2002 Published by Elsevier Science B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据