Bell's inequalities and quantum communication complexity

From MaRDI portal
Publication:2837604




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.




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)