Abstract
We establish several strong equivalences of synchronous non-local games, in the sense that the corresponding game algebras are ∗-isomorphic. We first show that the game algebra of any synchronous game on n inputs and k outputs is ∗-isomorphic to the game algebra of an associated bisynchronous game on nk inputs and nk outputs. As a result, we show that there are bisynchronous games with equal question and answer sets, whose optimal strategies only exist in the quantum commuting model, and not in the quantum approximate model. Moreover, we show that there are bisynchronous games with equal question and answer sets that have non-zero game algebras, but no winning quantum commuting strategies, resolving a problem of V.I. Paulsen and M. Rahaman. We also exhibit a ∗-isomorphism between any synchronous game algebra with n questions and k > 3 answers and a synchronous game algebra with n(k − 2) questions and 3 answers.
Original language | English (US) |
---|---|
Pages (from-to) | 924-946 |
Number of pages | 23 |
Journal | Quantum Information and Computation |
Volume | 22 |
Issue number | 11-12 |
DOIs | |
State | Published - Aug 2022 |
Externally published | Yes |
Keywords
- bisynchronous game
- game algebra
- synchronous game
ASJC Scopus subject areas
- Theoretical Computer Science
- Statistical and Nonlinear Physics
- Nuclear and High Energy Physics
- Mathematical Physics
- General Physics and Astronomy
- Computational Theory and Mathematics