pith. sign in

arxiv: quant-ph/0106121 · v2 · submitted 2001-06-21 · 🪐 quant-ph

A feasible quantum communication complexity protocol

classification 🪐 quant-ph
keywords communicationquantumcomplexityprotocoltaskamountclassicalcompute
0
0 comments X
read the original abstract

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 $\eta$. 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 $\eta>0.33$ .

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.