A feasible quantum communication complexity protocol
Quantum Physics
2009-11-07 v2
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 . 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 .
Cite
@article{arxiv.quant-ph/0106121,
title = {A feasible quantum communication complexity protocol},
author = {Ernesto F. Galvao},
journal= {arXiv preprint arXiv:quant-ph/0106121},
year = {2009}
}
Comments
8 pages, LaTeX, no figures. v2: included analysis of other experimental losses, 3 more refs., other minor changes