Communication complexity
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum Entanglement and Communication Complexity
SIAM Journal on Computing
Quantum Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Most proposals for quantum solutions of information-theoretic problems rely on the usage of multi-partite entangled states which are still difficult to produce experimentally with current state-of-the-art technology. Here, we analyze a scheme to simplify a particular kind of multiparty communication protocols for the experiment. We prove that the fidelity of two communication complexity protocols, allowing for an N 驴 1 bit communication, can be exponentially improved by N 驴 1 (unentangled) qubit communication. Taking into account, for a fair comparison, all inefficiencies of state-of-the-art set-up, the experimental implementation for N = 5 outperforms the best classical protocol, making it the candidate for multi-party quantum communication applications.