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:2603.17956 · Proceedings of the National Academy of Sciences

On the power of multipartite entanglement for pseudotelepathy

Gilles Brassard, Xavier Coiteux-Roy, Rémi Ligez

quant-phSubmitted Mar 18, 2026• Announced Mar 19, 2026• 0 citations
arXivHTMLPDF

Abstract

As early as 1935, Schrödinger recognized entanglement as ``not one but rather the characteristic trait of quantum mechanics, the one that enforces its entire departure from classical lines of thought''. Indeed, most remarkable phenomena in quantum information science, such as quantum computing and quantum teleportation, spring from clever uses of entanglement. Among them, pseudotelepathy enables two or more players to win systematically at some cooperative games with no need for communication between them, a restriction that would make the task impossible in a classical world. We investigate the power of multipartite entanglement for pseudotelepathy. Some known games that can be won with tripartite entanglement cannot be won with bipartite entanglement, but they can be won with bipartite nonsignalling resources such as the so-called Popescu--Rohrlich nonlocal box. We exhibit a five-player game that can be won with tripartite entanglement, but not with arbitrary bipartite nonsignalling resources even in the presence of arbitrary five-partite classical resources. This illustrates both the power of bipartite nonsignalling resources (over bipartite entanglement) and the even superior power of tripartite entanglement.

Related papers

Experimental Demonstration of Quantum Pseudotelepathy

Jia-Min Xu, Yi-Zheng Zhen, Yu-Xiang Yang +5 more

Quantum pseudotelepathy is a strong form of nonlocality. Different from the conventional nonlocal games where quantum strategies win statistically, e.g., the Clauser-Horne-Shimony-Holt game, quantum pseudotelepathy in principle allows quantum players to with probability 1. In this Letter, we report a faithful experimental demonstration of quantum pseudotelepathy via playing the nonlocal version of Mermin-Peres magic square game, where Alice and Bob cooperatively fill in a 3×3 magic square. We adopt the hyperentanglement scheme and prepare photon pairs entangled in both the polarization and the orbital angular momentum degrees of freedom, such that the experiment is carried out in a resource-efficient manner. Under the locality and fair-sampling assumption, our results show that quantum players can simultaneously win all the queries over any classical strategy.

arXiv:2206.12042•Physical Review Letters•Jul 26, 2022•24 citations

Resources for quantum information tasks: from the bipartite to the multipartite scenario

Mafalda L. Almeida

Quantum physics provides results at information processing tasks that are unattainable by any classical theory. The aim of this thesis is to identify and characterize quantum entanglement and quantum nonlocality, the key resources used at quantum information protocols. We consider the problem of finding better experimental schemes to detect entangled states. For that, we study approximate physical realizations to non-physical processes, which provide the most efficient method to identify entanglement. We prove that many of these physical approximations have a simple experimental implementation. We then study characterization of quantum nonlocality. We introduce a method using the multipartite scenario, where more than two parties are involved, which provides several results on bipartite and multipartite quantum nonlocality. First, we prove that there exist quantum states which contain full multipartite nonlocality, which consist of the strongest kind of nonlocality. then, we prove that the combined use of several copies of a state can activate its nonlocal properties. In particular, this holds for bipartite and genuine multipartite nonlocality. Finally, we characterize quantum nonlocality by distinguishing it from stronger-than-quantum nonlocality. We construct a multipartite game for which classical and quantum players perform equally well, but for which supre-quantum players can sometimes provide an advantage. Our results suggest that physical resources might obbey a generalized no-signaling principle ( according to which ther's no instantaneous communication).

•Jan 1, 2010•0 citations

On the power of quantum entanglement in multipartite quantum XOR games

Marius Junge, Carlos Palazuelos

Abstract We show that, given , there exist ‐player quantum XOR games for which the entangled bias can be arbitrarily larger than the bias of the game when the players are restricted to separable strategies. In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that, as a consequence of a noncommutative version of Grothendieck theorem, the entangled bias is always upper bounded by a universal constant times the one‐way classical communication bias. In this sense, our main result can be understood as a counterexample to an extension of such a noncommutative Grothendieck theorem to multilinear forms.

arXiv:2302.11800•Journal of the London Mathematical Society•Oct 25, 2024•1 citation

Quantum Computation and Pseudotelepathic Games

Jeffrey Bub

A quantum algorithm succeeds not because the superposition principle allows ‘the computation of all values of a function at once’ via ‘quantum parallelism’, but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information-processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I also introduce the notion of ‘pseudotelepathic’ games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players’ correlated responses in a game).

arXiv:1005.2449•Philosophy of Science•Oct 1, 2008•4 citations

Multipartite nonlocality as a resource and quantum correlations having indefinite causal order

Florian J. Curchod, Yeong-Cherng Liang, Nicolas Gisin

The characterization of quantum correlations in terms of information-theoretic resource has been a fruitful approach to understand the power of quantum correlations as a resource. While bipartite entanglement and Bell inequality violation in this setting have been extensively studied, relatively little is known about their multipartite counterpart. In this paper, we apply and adapt the recently proposed definitions of multipartite nonlocality (Bancal et al 2013 Phys. Rev. A 88 014102) to the three- and four-partite scenarios to gain new insight on the resource aspect of multipartite nonlocal quantum correlations. Specifically, we show that reproducing certain tripartite quantum correlations requires mixtures of classical resources—be it the ability to change the groupings or the time orderings of measurements. Thus, when seen from the perspective of biseparable one-way classical signaling resources, certain tripartite quantum correlations do not admit a definite causal order. In the four-partite scenario, we obtain a superset description of the set of biseparable correlations which can be produced by allowing two groups of bipartite non-signaling resources. Quantum violation of the resulting Bell-like inequalities is investigated. As a byproduct, we obtain some new examples of device-independent witnesses for genuine four-partite entanglement, and also device-independent witnesses that allow one to infer the structure of the underlying multipartite entanglement. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to '50 years of Bell's theorem'.

arXiv:1310.7598•Journal of Physics A Mathematical and Theoretical•Oct 9, 2014•14 citations

Absolute nonlocality via distributed computing without communication

Łukasz Czekaj, Marcin Pawłowski, Tamás Vértesi +3 more

Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose an alternative perspective for studying quantum entanglement: distributed computation of functions without communication between nodes. To formalize this approach, we propose identity games. Surprisingly, despite no signaling, we obtain that nonlocal quantum strategies beat classical ones in terms of winning probability for identity games originating from certain bipartite and multipartite functions. Moreover we show that, for a majority of functions, access to general nonsignaling resources boosts success probability two times in comparison to classical ones for a number of large enough outputs. Because there are no constraints on the inputs and no processing of the outputs in the identity games, they detect very strong types of correlations: absolute nonlocality.

arXiv:1408.0993•Physical Review A•Sep 18, 2015•1 citation
As early as 1935, Schrödinger recognized entanglement as ``not one but rather the characteristic trait of quantum mechanics, the one that enforces its entire departure from classical lines of thought''. Indeed, most remarkable phenomena in quantum information science, such as quantum computing and quantum teleportation, spring from clever uses of entanglement. Among them, pseudotelepathy enables two or more players to win systematically at some cooperative games with no need for communication between them, a restriction that would make the task impossible in a classical world. We investigate the power of multipartite entanglement for pseudotelepathy. Some known games that can be won with tripartite entanglement cannot be won with bipartite entanglement, but they can be won with bipartite nonsignalling resources such as the so-called Popescu--Rohrlich nonlocal box. We exhibit a five-player game that can be won with tripartite entanglement, but not with arbitrary bipartite nonsignalling resources even in the presence of arbitrary five-partite classical resources. This illustrates both the power of bipartite nonsignalling resources (over bipartite entanglement) and the even superior power of tripartite entanglement.
Quantum pseudotelepathy is a strong form of nonlocality. Different from the conventional nonlocal games where quantum strategies win statistically, e.g., the Clauser-Horne-Shimony-Holt game, quantum pseudotelepathy in principle allows quantum players to with probability 1. In this Letter, we report a faithful experimental demonstration of quantum pseudotelepathy via playing the nonlocal version of Mermin-Peres magic square game, where Alice and Bob cooperatively fill in a 3×3 magic square. We adopt the hyperentanglement scheme and prepare photon pairs entangled in both the polarization and the orbital angular momentum degrees of freedom, such that the experiment is carried out in a resource-efficient manner. Under the locality and fair-sampling assumption, our results show that quantum players can simultaneously win all the queries over any classical strategy.
Quantum physics provides results at information processing tasks that are unattainable by any classical theory. The aim of this thesis is to identify and characterize quantum entanglement and quantum nonlocality, the key resources used at quantum information protocols. We consider the problem of finding better experimental schemes to detect entangled states. For that, we study approximate physical realizations to non-physical processes, which provide the most efficient method to identify entanglement. We prove that many of these physical approximations have a simple experimental implementation. We then study characterization of quantum nonlocality. We introduce a method using the multipartite scenario, where more than two parties are involved, which provides several results on bipartite and multipartite quantum nonlocality. First, we prove that there exist quantum states which contain full multipartite nonlocality, which consist of the strongest kind of nonlocality. then, we prove that the combined use of several copies of a state can activate its nonlocal properties. In particular, this holds for bipartite and genuine multipartite nonlocality. Finally, we characterize quantum nonlocality by distinguishing it from stronger-than-quantum nonlocality. We construct a multipartite game for which classical and quantum players perform equally well, but for which supre-quantum players can sometimes provide an advantage. Our results suggest that physical resources might obbey a generalized no-signaling principle ( according to which ther's no instantaneous communication).
Abstract We show that, given , there exist ‐player quantum XOR games for which the entangled bias can be arbitrarily larger than the bias of the game when the players are restricted to separable strategies. In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that, as a consequence of a noncommutative version of Grothendieck theorem, the entangled bias is always upper bounded by a universal constant times the one‐way classical communication bias. In this sense, our main result can be understood as a counterexample to an extension of such a noncommutative Grothendieck theorem to multilinear forms.
A quantum algorithm succeeds not because the superposition principle allows ‘the computation of all values of a function at once’ via ‘quantum parallelism’, but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information-processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I also introduce the notion of ‘pseudotelepathic’ games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players’ correlated responses in a game).
The characterization of quantum correlations in terms of information-theoretic resource has been a fruitful approach to understand the power of quantum correlations as a resource. While bipartite entanglement and Bell inequality violation in this setting have been extensively studied, relatively little is known about their multipartite counterpart. In this paper, we apply and adapt the recently proposed definitions of multipartite nonlocality (Bancal et al 2013 Phys. Rev. A 88 014102) to the three- and four-partite scenarios to gain new insight on the resource aspect of multipartite nonlocal quantum correlations. Specifically, we show that reproducing certain tripartite quantum correlations requires mixtures of classical resources—be it the ability to change the groupings or the time orderings of measurements. Thus, when seen from the perspective of biseparable one-way classical signaling resources, certain tripartite quantum correlations do not admit a definite causal order. In the four-partite scenario, we obtain a superset description of the set of biseparable correlations which can be produced by allowing two groups of bipartite non-signaling resources. Quantum violation of the resulting Bell-like inequalities is investigated. As a byproduct, we obtain some new examples of device-independent witnesses for genuine four-partite entanglement, and also device-independent witnesses that allow one to infer the structure of the underlying multipartite entanglement. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to '50 years of Bell's theorem'.
Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose an alternative perspective for studying quantum entanglement: distributed computation of functions without communication between nodes. To formalize this approach, we propose identity games. Surprisingly, despite no signaling, we obtain that nonlocal quantum strategies beat classical ones in terms of winning probability for identity games originating from certain bipartite and multipartite functions. Moreover we show that, for a majority of functions, access to general nonsignaling resources boosts success probability two times in comparison to classical ones for a number of large enough outputs. Because there are no constraints on the inputs and no processing of the outputs in the identity games, they detect very strong types of correlations: absolute nonlocality.