Synchronous linear constraint system games

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