pith. machine review for the scientific record. sign in

arxiv: quant-ph/0502066 · v1 · submitted 2005-02-11 · 🪐 quant-ph

Recognition: unknown

Experimental quantum communication complexity

Authors on Pith no claims yet
classification 🪐 quant-ph
keywords communicationcomplexityexperimentalquantumaccountallowingapplicationsbest
0
0 comments X
read the original abstract

We prove that the fidelity of two exemplary 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 outperforms the best classical protocol, making it the candidate for multi-party quantum communication applications.

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.