Therefore, the upper bound on classical sum capacity is following C (L)(NMS)≤ max π(m) { H(M)+(log 9− f (9, η)) max i,j∈{0,1,2} {1−π1(i)π2(j)} } − log(9)

Upper bound on classical sum capacities In a magic square game, with any local deterministic (classical) protocol the game can be won for at most eight out of nine possible questio

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

Nonlocal and quantum advantages in network coding for multiple access channels

quant-ph · 2023-04-21 · unverdicted · novelty 7.0

Nonlocal and quantum resources yield strictly higher sum capacities than local resources for multiple-access channels constructed from CHSH and magic-square games.

citing papers explorer

Showing 1 of 1 citing paper.

Nonlocal and quantum advantages in network coding for multiple access channels quant-ph · 2023-04-21 · unverdicted · none · ref 8
Nonlocal and quantum resources yield strictly higher sum capacities than local resources for multiple-access channels constructed from CHSH and magic-square games.

Therefore, the upper bound on classical sum capacity is following C (L)(NMS)≤ max π(m) { H(M)+(log 9− f (9, η)) max i,j∈{0,1,2} {1−π1(i)π2(j)} } − log(9)

fields

years

verdicts

representative citing papers

citing papers explorer