Quantum XOR games

Oded Regev, Thomas Vidick

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a wide range of behaviors that are known not to exist for standard XOR games, such as cases in which the use of entanglement leads to an arbitrarily large advantage over the use of no entanglement. By invoking two deep extensions of Grothendieck's inequality, we present an efficient algorithm that gives a constant-factor approximation to the best performance players can obtain in a given game, both in case they have no shared entanglement and in case they share unlimited entanglement. As a byproduct of the algorithm we prove some additional interesting properties of quantum XOR games, such as the fact that sharing a maximally entangled state of arbitrary dimension gives only a small advantage over having no entanglement at all.

Original languageEnglish (US)
Title of host publicationProceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013
Pages144-155
Number of pages12
DOIs
StatePublished - 2013
Event2013 IEEE Conference on Computational Complexity, CCC 2013 - Palo Alto, CA, United States
Duration: Jun 5 2013Jun 7 2013

Other

Other2013 IEEE Conference on Computational Complexity, CCC 2013
CountryUnited States
CityPalo Alto, CA
Period6/5/136/7/13

Fingerprint

Quantum Games
Entanglement
Game
Byproducts
Entangled State
Quantum State
Sharing
Efficient Algorithms
Arbitrary
Approximation
Model
Range of data

Keywords

  • Grothendieck inequality
  • quantum games
  • semidefinite programming
  • XOR games

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Computational Mathematics

Cite this

Regev, O., & Vidick, T. (2013). Quantum XOR games. In Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013 (pp. 144-155). [6597757] https://doi.org/10.1109/CCC.2013.23

Quantum XOR games. / Regev, Oded; Vidick, Thomas.

Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013. 2013. p. 144-155 6597757.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Regev, O & Vidick, T 2013, Quantum XOR games. in Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013., 6597757, pp. 144-155, 2013 IEEE Conference on Computational Complexity, CCC 2013, Palo Alto, CA, United States, 6/5/13. https://doi.org/10.1109/CCC.2013.23
Regev O, Vidick T. Quantum XOR games. In Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013. 2013. p. 144-155. 6597757 https://doi.org/10.1109/CCC.2013.23
Regev, Oded ; Vidick, Thomas. / Quantum XOR games. Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013. 2013. pp. 144-155
@inproceedings{aa545e77975e4a20be3a1ed693ce337d,
title = "Quantum XOR games",
abstract = "We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a wide range of behaviors that are known not to exist for standard XOR games, such as cases in which the use of entanglement leads to an arbitrarily large advantage over the use of no entanglement. By invoking two deep extensions of Grothendieck's inequality, we present an efficient algorithm that gives a constant-factor approximation to the best performance players can obtain in a given game, both in case they have no shared entanglement and in case they share unlimited entanglement. As a byproduct of the algorithm we prove some additional interesting properties of quantum XOR games, such as the fact that sharing a maximally entangled state of arbitrary dimension gives only a small advantage over having no entanglement at all.",
keywords = "Grothendieck inequality, quantum games, semidefinite programming, XOR games",
author = "Oded Regev and Thomas Vidick",
year = "2013",
doi = "10.1109/CCC.2013.23",
language = "English (US)",
isbn = "9780769549972",
pages = "144--155",
booktitle = "Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013",

}

TY - GEN

T1 - Quantum XOR games

AU - Regev, Oded

AU - Vidick, Thomas

PY - 2013

Y1 - 2013

N2 - We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a wide range of behaviors that are known not to exist for standard XOR games, such as cases in which the use of entanglement leads to an arbitrarily large advantage over the use of no entanglement. By invoking two deep extensions of Grothendieck's inequality, we present an efficient algorithm that gives a constant-factor approximation to the best performance players can obtain in a given game, both in case they have no shared entanglement and in case they share unlimited entanglement. As a byproduct of the algorithm we prove some additional interesting properties of quantum XOR games, such as the fact that sharing a maximally entangled state of arbitrary dimension gives only a small advantage over having no entanglement at all.

AB - We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a wide range of behaviors that are known not to exist for standard XOR games, such as cases in which the use of entanglement leads to an arbitrarily large advantage over the use of no entanglement. By invoking two deep extensions of Grothendieck's inequality, we present an efficient algorithm that gives a constant-factor approximation to the best performance players can obtain in a given game, both in case they have no shared entanglement and in case they share unlimited entanglement. As a byproduct of the algorithm we prove some additional interesting properties of quantum XOR games, such as the fact that sharing a maximally entangled state of arbitrary dimension gives only a small advantage over having no entanglement at all.

KW - Grothendieck inequality

KW - quantum games

KW - semidefinite programming

KW - XOR games

UR - http://www.scopus.com/inward/record.url?scp=84885609414&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885609414&partnerID=8YFLogxK

U2 - 10.1109/CCC.2013.23

DO - 10.1109/CCC.2013.23

M3 - Conference contribution

SN - 9780769549972

SP - 144

EP - 155

BT - Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013

ER -