arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0106121quant-ph

A feasible quantum communication complexity protocol

Ernesto F. Galvao

英文摘要:

I show that a simple multi-party communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency $η$. The task is a communication complexity problem in which distant parties need to compute a function of the distributed inputs, while minimizing the amount of communication between them. A realistic quantum optical setup is suggested that can demonstrate a five-party quantum protocol with higher-than-classical performance, provided $η>0.33$ .

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

↑