This paper proves quantitative preservation of approximate winning strategies between arbitrary synchronous games and graph 3-coloring games, but its undecidability applications rely on an instance-dependent threshold and are therefore not established.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Approximate quantum 3-colorings of graphs and the quantum Max 3-Cut problem
This paper proves quantitative preservation of approximate winning strategies between arbitrary synchronous games and graph 3-coloring games, but its undecidability applications rely on an instance-dependent threshold and are therefore not established.