Suboptimality of Parity for Distilling Correlations with Nontrivial Marginals

Abstract

We prove that the PARITY protocol is optimal for a general class of non-adaptive distillation protocols of all $n$ player nonlocal boxes (NLBs) based on XOR games. The conditional distributions generated by these NLBs are assumed to have trivial local marginals. We also show that already for $n=2$, PARITY is no longer optimal if the local marginals are non-trivial. The OR protocol is shown to perform better and in the process also slightly extend the known correlations that collapse communication complexity. This emphasizes again the need to understand the local properties of nonlocal systems in order to obtain a better characterization of the global behavior. We conclude by showing an equivalence between adaptive distillation protocols that use identical NLBs and PARITY protocol using nonidentical NLBs.

References in corpus (15)

• Bell nonlocality
• Non-locality and Communication Complexity
• Non-local correlations as an information theoretic resource
• A limit on nonlocality in any world in which communication complexity is not trivial
• Local Quantum Measurement and No-Signaling Imply Quantum Correlations
• Non-locality distillation and post-quantum theories with trivial communication complexity
• Closed sets of non-local correlations
• Bell nonlocality is not sufficient for the security of standard device-independent quantum key distribution protocols
• Optimal Protocols for Nonlocality Distillation
• Bounds for Non-Locality Distillation Protocols
• Device-independent quantum key distribution with arbitrarily small nonlocality
• Distilling Nonlocality in Quantum Correlations
• Advantages of multi-copy nonlocality distillation and its application to minimizing communication complexity
• Extending the Known Region of Nonlocal Boxes that Collapse Communication Complexity
• Algebra of Nonlocal Boxes and the Collapse of Communication Complexity