Every perfect binary-output communication game reduces to graph coloring and orthogonal representation problems, and perfect qubit strategies never beat a classical bit.
de Wolf,Quantum Computing and Communication Complexity, Ph.D
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Perfect Games in Dimension-Bounded Communication
Every perfect binary-output communication game reduces to graph coloring and orthogonal representation problems, and perfect qubit strategies never beat a classical bit.