Transitive Nonlocal Games
- URL: http://arxiv.org/abs/2312.12040v1
- Date: Tue, 19 Dec 2023 10:49:41 GMT
- Title: Transitive Nonlocal Games
- Authors: Prem Nigam Kar, Jitendra Prakash, David E Roberson
- Abstract summary: We study a class of nonlocal games, called transitive games, for which the set of perfect strategies forms a semigroup.
We prove that the existence of a C*-strategy, the existence of a quantum commuting strategy, and the existence of a classical strategy are all equivalent.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We study a class of nonlocal games, called transitive games, for which the
set of perfect strategies forms a semigroup. We establish several interesting
correspondences of bisynchronous transitive games with the theory of compact
quantum groups. In particular, we associate a quantum permutation group with
each bisynchronous transitive game and vice versa. We prove that the existence
of a C*-strategy, the existence of a quantum commuting strategy, and the
existence of a classical strategy are all equivalent for bisynchronous
transitive games. We then use some of these correspondences to establish
necessary and sufficient conditions for some classes of correlations, that
arise as perfect strategies of transitive games, to be nonlocal.
Related papers
- Communication Complexity of Graph Isomorphism, Coloring, and Distance Games [0.0]
We show that perfect non-signalling strategies collapse communication complexity under favorable conditions.
Surprisingly, we observe that non-signalling strategies provide a finer distinction for the new game compared to classical and quantum strategies.
arXiv Detail & Related papers (2024-06-04T10:53:16Z) - Permissible extensions of classical to quantum games combining three strategies [0.0]
We study the extension of classical games to the quantum domain.
We use the obtained results to extend the classical Prisoner's Dilemma game to a quantum game.
arXiv Detail & Related papers (2024-04-09T10:38:10Z) - Repeated quantum game as a stochastic game: Effects of the shadow of the
future and entanglement [0.0]
We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol.
We find that how two pure strategies fare against each other is crucially dependent on the discount factor.
In the quantum game setup, always-defect strategy can be beaten by the tit-for-tat strategy for high enough discount factor.
arXiv Detail & Related papers (2023-12-08T15:54:51Z) - Photonic implementation of the quantum Morra game [69.65384453064829]
We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case.
We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game.
We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
arXiv Detail & Related papers (2023-11-14T19:41:50Z) - Unifying different notions of quantum incompatibility into a strict
hierarchy of resource theories of communication [60.18814584837969]
We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility.
We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
arXiv Detail & Related papers (2022-11-16T21:33:31Z) - Optimal Correlated Equilibria in General-Sum Extensive-Form Games:
Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation [99.00383370823839]
We study the problem of finding optimal correlated equilibria of various sorts.
We introduce the correlation DAG, a representation of the space of correlated strategies whose size is dependent on the specific solution concept.
We also introduce two new benchmark games: a trick-taking game that emulates the endgame phase of the card game bridge, and a ride-sharing game.
arXiv Detail & Related papers (2022-03-14T15:21:18Z) - Rounding near-optimal quantum strategies for nonlocal games to strategies using maximally entangled states [0.0]
In particular, we show that near-perfect quantum strategies are approximate representations of the corresponding BCS algebra in the little Frobenius norm.
For the class of XOR nonlocal games, we show that near-optimal quantum strategies are approximate representations of the corresponding *-algebra associated with the game.
arXiv Detail & Related papers (2022-03-04T19:05:58Z) - On the relation between completely bounded and $(1,cb)$-summing maps
with applications to quantum XOR games [65.51757376525798]
We show that given a linear map from a general operator space into the dual of a C$*$-algebra, its completely bounded norm is upper bounded by a universal constant times its $(''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
arXiv Detail & Related papers (2021-12-09T21:06:52Z) - Synchronicity for quantum non-local games [0.7646713951724009]
We show that quantum homomorphisms of quantum graphs can be viewed as entanglement assisted classical homomorphisms of the graphs.
We give descriptions of the perfect quantum commuting and the perfect approximately quantum strategies for the quantum graph homomorphism game.
arXiv Detail & Related papers (2021-06-22T02:40:41Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Coordinate Independent Convolutional Networks -- Isometry and Gauge
Equivariant Convolutions on Riemannian Manifolds [70.32518963244466]
A major complication in comparison to flat spaces is that it is unclear in which alignment a convolution kernel should be applied on a manifold.
We argue that the particular choice of coordinatization should not affect a network's inference -- it should be coordinate independent.
A simultaneous demand for coordinate independence and weight sharing is shown to result in a requirement on the network to be equivariant.
arXiv Detail & Related papers (2021-06-10T19:54:19Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.