Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1011.6245

Biased nonlocal quantum games

Thomas Lawson, Noah Linden, Sandu Popescu

Published Nov 29, 2010• 12 citations
arXivHTMLPDF

Abstract

We address the question of when quantum entanglement is a useful resource for information processing tasks by presenting a new class of nonlocal games that are simple, direct, generalizations of the Clauser Horne Shimony Holt game. For some ranges of the parameters that specify the games, quantum mechanics offers an advantage, while, surprisingly, for others quantum mechanics is no more powerful than classical mechanics in performing the nonlocal task. This sheds new light on the difference between classical, quantum and super-quantum correlations.

DOI
10.48550/arxiv.1011.6245

Related papers

Arbitrarily little knowledge can give a quantum advantage for nonlocal tasks

Jonathan Allcock, Harry Buhrman, Noah Linden

It has previously been shown that quantum nonlocality offers no benefit over classical correlations for performing a distributed task known as nonlocal computation. This is where separated parties must compute the value of a function without individually learning anything about the inputs. We show that giving the parties some knowledge of the inputs, however small, is sufficient to ``unlock'' the power of quantum mechanics to outperform classical mechanics. This role of information held locally gives insight into the general question of when quantum nonlocality gives an advantage over classical physics. Our results also reveal an interesting feature of the nonlocality embodied in the celebrated task of Clauser, Horne, Shimony, and Holt.

arXiv:0903.0586•Physical Review A•Sep 10, 2009•2 citations

Nonlocal Games and Information Causality

Prabhav Jain

Quantum mechanics has been a paradigm shift and a revolutionary framework in our understanding of the physical world. The theory has been able to describe a wide variety of phenomena and has been experimentally verified with great precision. Despite that, to this day, the seemingly ad hoc formulation of quantum theory and several of its features still elude an intuitive understanding. At the same time, the applications of quantum mechanics in information theory have emerged as a promising avenue. Namely, its potential advantages in computation, in the so-called nascent field of quantum computation and in communication and information processing tasks such as quantum teleportation and super-dense coding. In all these endeavours, a significant effort has been made in understanding the maximum extent to which quantum mechanics can provide an advantage. This thesis explores an intersection of these two research lines, i.e. to have a physical explanation of some of the features of quantum mechanics and at the same time, study the outer limits of quantum mechanics. The combining insight rests on a newer foundational idea: that information itself is physical rather than an abstract entity and thus, is subject to physical laws. In this thesis, we explore the principle of information causality, which states that in any communication scenario, the amount of information carried is bounded by the degrees of freedom of the carrier. Information causality was initially proposed as a physical principle aimed at deriving the predictions of quantum mechanics on the type of correlations observed in a Bell scenario, which is a communication scenario involving multiple parties with access to a shared randomness resource. This principle has been proposed to recover some of the well-known features of quantum mechanics, specifically Tsirelson’s bound of the Clauser-Horne-Shimony-Holt inequality. Earlier results found limited generalisations due to the difficulty of deducing implications of the information causality principle. In this thesis, we greatly expand the scope of applicability of the principle. We develop a general-purpose algorithm to derive constraints on the set of quantum correlations. We extend the principle to be applicable to a wider variety of Bell scenarios, derive new families of quantum Bell inequalities and prove new bounds on the success probabilities of Entanglement Assisted Random Access Codes. We introduce an extension of the principle which applies to any distributed computing scenario. Using this extension, we improve on several previously known results in the field, and in certain cases, we even recover part of the quantum set as well. This extension provides rich insights into the communication complexity of distributed functions, using which we prove theory-independent randomised communication complexity bounds for several well-known functions and provide another general-purpose algorithm to bound the randomised quantum communication complexity of any function. As a consequence of the extension, we also establish that the extension supersedes the principle of non-trivial communication complexity.

•Aug 11, 2026•0 citations

Distilling Nonlocality

Manuel Förster, Severin Winkler, Stefan Wolf

Two parts of an entangled quantum state can have a correlation, in their joint behavior under measurements, that is unexplainable by shared classical information. Such correlations are called nonlocal and have proven to be an interesting resource for information processing. Since nonlocal correlations are more useful if they are stronger, it is natural to ask whether weak nonlocality can be amplified. We give an affirmative answer by presenting the first protocol for distilling nonlocality in the framework of generalized nonsignaling theories. Our protocol works for both quantum and nonquantum correlations. This shows that in many contexts, the extent to which a single instance of a correlation can violate a Clauser-Horne-Shimony-Holt inequality is not a good measure for the usefulness of nonlocality. A more meaningful measure follows from our results.

arXiv:0809.3173•Physical Review Letters•Mar 24, 2009•82 citations

Entanglement witness game

Xing Chen, Xueyuan Hu, D. L. Zhou

Motivated by Buscemi's semiquantum nonlocal game [F. Buscemi, Phys. Rev. Lett. 108, 200401 (2012)], we propose an entanglement witness game, a quantum game based on entanglement witness. Similar to the semiquantum nonlocal game, the existence of entanglement shared by the players is necessary and sufficient for obtaining a positive average payoff in our entanglement witness game. Two explicit examples are constructed to demonstrate how to play our entanglement witness game and its relations with the Clauser-Horne-Shimony-Holt nonlocal game.

arXiv:1701.01240•Physical Review A•May 12, 2017•6 citations

Quantum bidding in Bridge

Sadiq Muhammad, Armin Tavakoli, Maciej Kurant +3 more

Quantum methods allow to reduce communication complexity of some computational tasks, with several separated partners, beyond classical constraints. Nevertheless, experimental demonstrations of this fact are thus far limited to some abstract problems, far away from real-life tasks. We show here, and demonstrate experimentally, that the power of reduction of communication complexity can be harnessed to gain advantage in famous, immensely popular, card game - Bridge. The essence of a winning strategy in Bridge is efficient communication between the partners. The rules of the game allow only specific form of communication, of a very low complexity (effectively one has a strong limitations on number of exchanged bits). Surprisingly, our quantum technique is not violating the existing rules of the game (as there is no increase in information flow). We show that our quantum Bridge auction corresponds to a biased nonlocal Clauser-Horne-Shimony-Holt (CHSH) game, which is equivalent to a $2\to 1$ quantum random access code. Thus our experiment is also a realization of such protocols. However, this correspondence is not full which enables the Bridge players to have efficient strategies regardless of the quality of their detectors.

arXiv:1403.4280•Mar 17, 2014•0 citations

Quantum Locality in Game Strategy

Carlos A. Melo-Luna, Cristian E. Susa, Andrés F. Ducuara +2 more

Game theory is a well established branch of mathematics whose formalism has a vast range of applications from the social sciences, biology, to economics. Motivated by quantum information science, there has been a leap in the formulation of novel game strategies that lead to new (quantum Nash) equilibrium points whereby players in some classical games are always outperformed if sharing and processing joint information ruled by the laws of quantum physics is allowed. We show that, for a bipartite non zero-sum game, input local quantum correlations, and separable states in particular, suffice to achieve an advantage over any strategy that uses classical resources, thus dispensing with quantum nonlocality, entanglement, or even discord between the players' input states. This highlights the remarkable key role played by pure quantum coherence at powering some protocols. Finally, we propose an experiment that uses separable states and basic photon interferometry to demonstrate the locally-correlated quantum advantage.

arXiv:1609.06389•Scientific Reports•Mar 22, 2017•31 citations
We address the question of when quantum entanglement is a useful resource for information processing tasks by presenting a new class of nonlocal games that are simple, direct, generalizations of the Clauser Horne Shimony Holt game. For some ranges of the parameters that specify the games, quantum mechanics offers an advantage, while, surprisingly, for others quantum mechanics is no more powerful than classical mechanics in performing the nonlocal task. This sheds new light on the difference between classical, quantum and super-quantum correlations.
It has previously been shown that quantum nonlocality offers no benefit over classical correlations for performing a distributed task known as nonlocal computation. This is where separated parties must compute the value of a function without individually learning anything about the inputs. We show that giving the parties some knowledge of the inputs, however small, is sufficient to ``unlock'' the power of quantum mechanics to outperform classical mechanics. This role of information held locally gives insight into the general question of when quantum nonlocality gives an advantage over classical physics. Our results also reveal an interesting feature of the nonlocality embodied in the celebrated task of Clauser, Horne, Shimony, and Holt.
Quantum mechanics has been a paradigm shift and a revolutionary framework in our understanding of the physical world. The theory has been able to describe a wide variety of phenomena and has been experimentally verified with great precision. Despite that, to this day, the seemingly ad hoc formulation of quantum theory and several of its features still elude an intuitive understanding. At the same time, the applications of quantum mechanics in information theory have emerged as a promising avenue. Namely, its potential advantages in computation, in the so-called nascent field of quantum computation and in communication and information processing tasks such as quantum teleportation and super-dense coding. In all these endeavours, a significant effort has been made in understanding the maximum extent to which quantum mechanics can provide an advantage. This thesis explores an intersection of these two research lines, i.e. to have a physical explanation of some of the features of quantum mechanics and at the same time, study the outer limits of quantum mechanics. The combining insight rests on a newer foundational idea: that information itself is physical rather than an abstract entity and thus, is subject to physical laws. In this thesis, we explore the principle of information causality, which states that in any communication scenario, the amount of information carried is bounded by the degrees of freedom of the carrier. Information causality was initially proposed as a physical principle aimed at deriving the predictions of quantum mechanics on the type of correlations observed in a Bell scenario, which is a communication scenario involving multiple parties with access to a shared randomness resource. This principle has been proposed to recover some of the well-known features of quantum mechanics, specifically Tsirelson’s bound of the Clauser-Horne-Shimony-Holt inequality. Earlier results found limited generalisations due to the difficulty of deducing implications of the information causality principle. In this thesis, we greatly expand the scope of applicability of the principle. We develop a general-purpose algorithm to derive constraints on the set of quantum correlations. We extend the principle to be applicable to a wider variety of Bell scenarios, derive new families of quantum Bell inequalities and prove new bounds on the success probabilities of Entanglement Assisted Random Access Codes. We introduce an extension of the principle which applies to any distributed computing scenario. Using this extension, we improve on several previously known results in the field, and in certain cases, we even recover part of the quantum set as well. This extension provides rich insights into the communication complexity of distributed functions, using which we prove theory-independent randomised communication complexity bounds for several well-known functions and provide another general-purpose algorithm to bound the randomised quantum communication complexity of any function. As a consequence of the extension, we also establish that the extension supersedes the principle of non-trivial communication complexity.
Two parts of an entangled quantum state can have a correlation, in their joint behavior under measurements, that is unexplainable by shared classical information. Such correlations are called nonlocal and have proven to be an interesting resource for information processing. Since nonlocal correlations are more useful if they are stronger, it is natural to ask whether weak nonlocality can be amplified. We give an affirmative answer by presenting the first protocol for distilling nonlocality in the framework of generalized nonsignaling theories. Our protocol works for both quantum and nonquantum correlations. This shows that in many contexts, the extent to which a single instance of a correlation can violate a Clauser-Horne-Shimony-Holt inequality is not a good measure for the usefulness of nonlocality. A more meaningful measure follows from our results.
Motivated by Buscemi's semiquantum nonlocal game [F. Buscemi, Phys. Rev. Lett. 108, 200401 (2012)], we propose an entanglement witness game, a quantum game based on entanglement witness. Similar to the semiquantum nonlocal game, the existence of entanglement shared by the players is necessary and sufficient for obtaining a positive average payoff in our entanglement witness game. Two explicit examples are constructed to demonstrate how to play our entanglement witness game and its relations with the Clauser-Horne-Shimony-Holt nonlocal game.
Quantum methods allow to reduce communication complexity of some computational tasks, with several separated partners, beyond classical constraints. Nevertheless, experimental demonstrations of this fact are thus far limited to some abstract problems, far away from real-life tasks. We show here, and demonstrate experimentally, that the power of reduction of communication complexity can be harnessed to gain advantage in famous, immensely popular, card game - Bridge. The essence of a winning strategy in Bridge is efficient communication between the partners. The rules of the game allow only specific form of communication, of a very low complexity (effectively one has a strong limitations on number of exchanged bits). Surprisingly, our quantum technique is not violating the existing rules of the game (as there is no increase in information flow). We show that our quantum Bridge auction corresponds to a biased nonlocal Clauser-Horne-Shimony-Holt (CHSH) game, which is equivalent to a 2→12\to 12→1 quantum random access code. Thus our experiment is also a realization of such protocols. However, this correspondence is not full which enables the Bridge players to have efficient strategies regardless of the quality of their detectors.
Game theory is a well established branch of mathematics whose formalism has a vast range of applications from the social sciences, biology, to economics. Motivated by quantum information science, there has been a leap in the formulation of novel game strategies that lead to new (quantum Nash) equilibrium points whereby players in some classical games are always outperformed if sharing and processing joint information ruled by the laws of quantum physics is allowed. We show that, for a bipartite non zero-sum game, input local quantum correlations, and separable states in particular, suffice to achieve an advantage over any strategy that uses classical resources, thus dispensing with quantum nonlocality, entanglement, or even discord between the players' input states. This highlights the remarkable key role played by pure quantum coherence at powering some protocols. Finally, we propose an experiment that uses separable states and basic photon interferometry to demonstrate the locally-correlated quantum advantage.