Binary constraint system games and locally commutative reductions
Z Ji - arXiv preprint arXiv:1310.3794, 2013 - arxiv.org
A binary constraint system game is a two-player one-round non-local game defined by a
system of Boolean constraints. The game has a perfect quantum strategy if and only if the
constraint system has a quantum satisfying assignment [R. Cleve and R. Mittal, arXiv:
1209.2729]. We show that several concepts including the quantum chromatic number and
the Kochen-Specker sets that arose from different contexts fit naturally in the binary
constraint system framework. The structure and complexity of the quantum satisfiability …
system of Boolean constraints. The game has a perfect quantum strategy if and only if the
constraint system has a quantum satisfying assignment [R. Cleve and R. Mittal, arXiv:
1209.2729]. We show that several concepts including the quantum chromatic number and
the Kochen-Specker sets that arose from different contexts fit naturally in the binary
constraint system framework. The structure and complexity of the quantum satisfiability …
[CITATION][C] Binary constraint system games and locally commutative reductions (2013)
Z Ji - arXiv preprint arXiv:1310.3794, 2013
Showing the best results for this search. See all results