Bell's inequalities and quantum communication complexity

From MaRDI portal
Publication:2837604

DOI10.1103/PHYSREVLETT.92.127901zbMATH Open1267.81086arXivquant-ph/0210114OpenAlexW2171172588WikidataQ62476727 ScholiaQ62476727MaRDI QIDQ2837604FDOQ2837604


Authors: Časlav Brukner, Marek Żukowski, Jian-Wei Pan, Anton Zeilinger Edit this on Wikidata


Publication date: 11 July 2013

Published in: Physical Review Letters (Search for Journal in Brave)

Abstract: We prove that for every Bell's inequality and for a broad class of protocols, there always exists a multi-party communication complexity problem, for which the protocol assisted by states which violate the inequality is more efficient than any classical protocol. Moreover, for that advantage Bell's inequality violation is a necessary and sufficient criterion. Thus, violation of Bell's inequalities has a significance beyond that of a non-optimal-witness of non-separability.


Full work available at URL: https://arxiv.org/abs/quant-ph/0210114




Recommendations



Cites Work


Cited In (54)





This page was built for publication: Bell's inequalities and quantum communication complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2837604)