solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看3950次
A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem. (arXiv:1901.11105v1 [cs.IT])
来源于:arXiv
We present an information theoretic proof of the nonsignalling multiprover
parallel repetition theorem, a recent extension of its two-prover variant that
underlies many hardness of approximation results. The original proofs used de
Finetti type decomposition for strategies. We present a new proof that is based
on a technique we introduced recently for proving strong converse results in
multiuser information theory and entails a change of measure after replacing
hard information constraints with soft ones. 查看全文>>