{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:29:15Z","timestamp":1648967355393},"reference-count":0,"publisher":"Rinton Press","issue":"11&12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["QIC"],"published-print":{"date-parts":[[2010,11]]},"abstract":"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 called entangled if the players are allowed to share a priori entanglement. It is well-known that the maximum winning probability (value) of entangled XOR-games (binary games in which the predetermined property depends only on the XOR of the two output bits) can be computed by a semidefinite program. In this paper we extend this result in the following sense; if a binary game is uniform, meaning that in an optimal strategy the marginal distributions of the output of each player are uniform, then its entangled value can be efficiently computed by a semidefinite program. We also introduce a lower bound on the entangled value of a general two-player one-round game; this bound depends on the size of the output set of each player and can be computed by a semidefinite program. In particular, we show that if the game is binary, $\\omega_q$ is its entangled value, and $\\omega_{sdp}$ is the optimum value of the corresponding semidefinite program, then $0.68\\,\\omega_{sdp} < \\omega_q \\leq \\omega_{sdp}$.<\/jats:p>","DOI":"10.26421\/qic10.11-12-2","type":"journal-article","created":{"date-parts":[[2021,3,7]],"date-time":"2021-03-07T20:53:00Z","timestamp":1615150380000},"page":"911-924","source":"Crossref","is-referenced-by-count":0,"title":["A lower bound on the value of entangled binary games"],"prefix":"10.26421","volume":"10","author":[{"given":"Salman","family":"Beigi","sequence":"first","affiliation":[]}],"member":"10955","published-online":{"date-parts":[[2010,11]]},"container-title":["Quantum Information and Computation"],"original-title":[],"deposited":{"date-parts":[[2021,3,7]],"date-time":"2021-03-07T20:53:02Z","timestamp":1615150382000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rintonpress.com\/journals\/doi\/QIC10.11-12-2.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11]]},"references-count":0,"journal-issue":{"issue":"11&12","published-online":{"date-parts":[[2010,11]]},"published-print":{"date-parts":[[2010,11]]}},"URL":"http:\/\/dx.doi.org\/10.26421\/qic10.11-12-2","relation":{},"ISSN":["1533-7146","1533-7146"],"issn-type":[{"value":"1533-7146","type":"print"},{"value":"1533-7146","type":"electronic"}],"subject":["Computational Theory and Mathematics","General Physics and Astronomy","Mathematical Physics","Nuclear and High Energy Physics","Statistical and Nonlinear Physics","Theoretical Computer Science"],"published":{"date-parts":[[2010,11]]}}}