Quantum bounds on multiplayer linear games and device-independent witness of genuine tripartite entanglement

Abstract

Here we study multiplayer linear games, a natural generalization of XOR games to multiple outcomes. We generalize a recently proposed efficiently computable bound, in terms of the norm of a game matrix, on the quantum value of 2-player games to linear games with $n$ players. As an example, we bound the quantum value of a generalization of the well-known CHSH game to $n$ players and $d$ outcomes. We also apply the bound to show in a simple manner that any nontrivial functional box, that could lead to trivialization of communication complexity in a multiparty scenario, cannot be realized in quantum mechanics. We then present a systematic method to derive device-independent witnesses of genuine tripartite entanglement.

arXiv comment7+8 pages

References in corpus (26)

• Separability of Mixed States: Necessary and Sufficient Conditions
• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Non-locality and Communication Complexity
• Fully device independent quantum key distribution
• Free randomness can be amplified
• Measure of genuine multipartite entanglement with computable lower bounds
• Efficient Toffoli Gates Using Qudits
• Violation of Bell's inequality: criterion for quantum communication complexity advantage
• Device-independent witnesses of genuine multipartite entanglement
• The structure of multidimensional entanglement in multipartite systems
• No quantum advantage for nonlocal computation
• Popescu-Rohrlich correlations as a unit of nonlocality
• Tsirelson bounds for generalized Clauser-Horne-Shimony-Holt inequalities
• Quantum key distribution session with 16-dimensional photonic states
• Witnessing genuine multipartite entanglement with positive maps
• Weak randomness in device independent quantum key distribution and the advantage of using high dimensional entanglement
• Reexamination of a multisetting Bell inequality for qudits
• Causality and Cirel'son bounds
• Practical relativistic bit commitment
• A framework for the study of symmetric full-correlation Bell-like inequalities
• Multi-setting Bell inequality for qudits
• Multisetting Bell-type inequalities for detecting genuine tripartite entanglement
• No quantum realization of extremal no-signaling boxes
• Designing Bell inequalities from a Tsirelson bound
• Characterising the Performance of XOR Games and the Shannon Capacity of Graphs
• Functional boxes, communication complexity and information causality

Cited by in corpus (7)

• Semi-device-independent characterisation of multipartite entangled states and measurements
• Device Independent Quantum Secret Sharing in Arbitrary Even Dimension
• Generalized XOR games with $d$ outcomes and the task of non-local computation
• Trade-offs in multi-party Bell inequality violations in qubit networks
• Analytic Semi-device-independent Entanglement Quantification for Bipartite Quantum States
• Quantifying Multipartite Quantum Entanglement in a Semi-Device-Independent Manner
• Constructive nonlocal games with very small classical values