2001/06/30 by Ernesto F. Galvão, Ernesto F. Galvao
Computer Science · Engineering · Physics and Astronomy · #Biology #Communication complexity #Communications protocol #Computer network #Computer science #Distributed computing #Engineering #Function (biology) #Physics #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum information science #Quantum mechanics #Simple (philosophy) #Task (project management) #Theoretical computer science #quant-ph
paper · pdf · doi:10.1103/physreva.65.012318
published as Phys. Rev. A 65, 012318 (2002) · 8 pages, LaTeX, no figures. v2: included analysis of other experimental losses, 3 more refs., other minor changes
arxiv created 2001/10/01 · openalex publication_date 2001/12/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
I show that a simple multiparty communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency \ensuremathη. 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 \ensuremathη>0.33.