Every perfect binary-output communication game reduces to graph coloring and orthogonal representation problems, and perfect qubit strategies never beat a classical bit.
In particular, seven preparations are minimal for a qutrit-over-trit perfect separation within the Torpedo construction when all four Bob inputsq∈F 3 ∪ {∞}are retained
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 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.