English
Related papers

Related papers: A parallel repetition theorem for all entangled ga…

200 papers

We demonstrate that parallel repetition of the multiplayer anchored optimal value, $\omega \big( G_{\bot} \big)^{\otimes n}$, decays exponentially. Central to our approach are several probabilistic computations, pertaining to: (1) the…

Quantum Physics · Physics 2025-08-14 Pete Rigas

We prove that for any 3-player game $\mathcal G$, whose query distribution has the same support as the GHZ game (i.e., all $x,y,z\in \{0,1\}$ satisfying $x+y+z=0\pmod{2}$), the value of the $n$-fold parallel repetition of $\mathcal G$…

Computational Complexity · Computer Science 2026-02-11 Yang P. Liu , Shachar Lovett , Kunal Mittal

We prove that for every 3-player (3-prover) game $\mathcal G$ with value less than one, whose query distribution has the support $\mathcal S = \{(1,0,0), (0,1,0), (0,0,1)\}$ of hamming weight one vectors, the value of the $n$-fold parallel…

Computational Complexity · Computer Science 2022-04-05 Uma Girish , Kunal Mittal , Ran Raz , Wei Zhan

We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…

Quantum Physics · Physics 2024-02-27 Archan Mukhopadhyay , Saikat Sur , Tanay Saha , Shubhadeep Sadhukhan , Sagar Chakraborty

Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called "Bell inequality violations." We give two new two-player games with Bell inequality violations that…

Quantum Physics · Physics 2022-03-01 Harry Buhrman , Oded Regev , Giannicola Scarpa , Ronald de Wolf

We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions…

Quantum Physics · Physics 2009-09-03 Gus Gutoski

A two-player one-round binary game consists of two cooperative players who each replies by one bit to a message that he receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is…

Quantum Physics · Physics 2011-06-22 Salman Beigi

Non-local games are widely studied as a model to investigate the properties of quantum mechanics as opposed to classical mechanics. In this paper, we consider a subset of non-local games: symmetric XOR games of $n$ players with 0-1 valued…

Quantum Physics · Physics 2013-02-12 Andris Ambainis , Jānis Iraids

We study parallel repetition of k-player games where the constraints satisfy the projection property. We prove exponential decay in the value of a parallel repetition of projection games with value less than 1.

Computational Complexity · Computer Science 2023-12-11 Amey Bhangale , Mark Braverman , Subhash Khot , Yang P. Liu , Dor Minzer

We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bits received. We show that, when the provers are allowed to…

Quantum Physics · Physics 2008-04-11 Richard Cleve , William Slofstra , Falk Unger , Sarvagya Upadhyay

In a recent paper, Junge and Palazuelos presented two two-player games exhibiting interesting properties. In their first game, entangled players can perform notably better than classical players. The quantitative gap between the two cases…

Quantum Physics · Physics 2011-08-05 Oded Regev

We show that the maximum success probability of players sharing quantum entanglement in a two-player game with classical questions of logarithmic length and classical answers of constant length is NP-hard to approximate to within constant…

Quantum Physics · Physics 2020-11-24 Anand Natarajan , Thomas Vidick

Mertens [In Proceedings of the International Congress of Mathematicians (Berkeley, Calif., 1986) (1987) 1528-1577 Amer. Math. Soc.] proposed two general conjectures about repeated games: the first one is that, in any two-person zero-sum…

Optimization and Control · Mathematics 2016-03-16 Bruno Ziliotto

XOR games are the simplest model in which the nonlocal properties of entanglement manifest themselves. When there are two players, it is well known that the bias --- the maximum advantage over random play --- of entangled players can be at…

Quantum Physics · Physics 2015-05-30 Jop Briet , Thomas Vidick

Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied, however…

Quantum Physics · Physics 2023-12-12 Kazuki Ikeda , Shoto Aoki

The behavior of entangled quantum systems can generally not be explained as being determined by shared classical randomness. In the first part of this paper, we propose a simple game for n players demonstrating this non-local property of…

Quantum Physics · Physics 2013-01-01 Renato Renner , Stefan Wolf

In a recent work, Moshkovitz [FOCS '14] presented a transformation on two-player games called "fortification", and gave an elementary proof of an (exponential decay) parallel repetition theorem for fortified two-player projection games. In…

Quantum Physics · Physics 2016-03-18 Mohammad Bavarian , Thomas Vidick , Henry Yuen

In this thesis, we answer several questions about the behaviour of prover-verifier interactions under parallel repetition when quantum information is allowed, and the verifier acts independently in them. We first consider the case in which…

Quantum Physics · Physics 2012-03-23 Abel Molina

Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player-two…

Quantum Physics · Physics 2007-05-23 Sahin Kaya Ozdemir , Junichi Shimamura , Nobuyuki Imoto

This paper examines multiplayer symmetric constant-sum games with more than two players in a competitive setting, including examples like Mahjong, Poker, and various board and video games. In contrast to two-player zero-sum games,…

Machine Learning · Computer Science 2024-10-04 Jiawei Ge , Yuanhao Wang , Wenzhe Li , Chi Jin