Synchronous linear constraint system games
Adina Goldberg · Journal of Mathematical Physics · 2021
Mathematical models of quantum mechanics can be studied and distinguished using nonlocal games. We discuss a class of nonlocal games called synchronous linear constraint system (syncLCS) games. We unify two algebraic approaches to studying syncLCS games and relate these games to nonlocal games played on graphs, known as graph isomorphism games. In more detail, syncLCS games are nonlocal games that verify whether or not two players share a solution to a given system of equations. Two algebraic objects associated with these games encode information about the existence of perfect strategies. They are called the game algebra and the solution group. Here, we show that these objects are essentially the same, i.e., the game algebra is a suitable quotient of the group algebra of the solution group. We also demonstrate that syncLCS games are equivalent to graph isomorphism games on a pair of graphs parameterized by the linear system.