Independent set games with a constant number of questions are RE-complete for entangled provers, so their gapped quantum value is undecidable while the classical problem is polynomial-time solvable.
Tracial embeddable strategies: Lifting MIP* tricks to MIP co
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Gap-preserving reductions and RE-completeness of independent set games
Independent set games with a constant number of questions are RE-complete for entangled provers, so their gapped quantum value is undecidable while the classical problem is polynomial-time solvable.