English

Parallel repetition of expanded, and multiplayer, Quantum games: anchoring, optimal values, generalized error bounds, dependency-breaking as symmetry-breaking

Quantum Physics 2025-08-14 v1 Information Theory math.IT Probability

Abstract

We demonstrate that parallel repetition of the multiplayer anchored optimal value, ω(G)n\omega \big( G_{\bot} \big)^{\otimes n}, decays exponentially. Central to our approach are several probabilistic computations, pertaining to: (1) the computation of expected values for quantifying how the winning probability of the game is likely to change under the anchoring transformation; (2) the computation of positive operator valued measurements, which can be placed into direct correspondence with several probabilistically defined quantities; (3) the computation of Relative, and Relative-min entropies; (4) and lastly, the computation of generalized error bounds, which have previously been analyzed by the author in several multiplayer game-theoretic settings (arXiv: 2505.06322, and arXiv: 2507.03035). This work builds upon observations originally provided by Bavarian, Vidick, and Yuen (arXiv: 1509.07466).

Keywords

Cite

@article{arxiv.2508.09380,
  title  = {Parallel repetition of expanded, and multiplayer, Quantum games: anchoring, optimal values, generalized error bounds, dependency-breaking as symmetry-breaking},
  author = {Pete Rigas},
  journal= {arXiv preprint arXiv:2508.09380},
  year   = {2025}
}

Comments

Template (129 pages). Presentations discussing this work are at: https://www.youtube.com/playlist?list=PL3rTBtU0TK_Cy35rrbIBmeNiBsWkhfvCe. Related topics of discussion are available at: https://m.youtube.com/playlist?list=PL3rTBtU0TK_DEFrUY_h-ZX4KLBKcuaF92, https://m.youtube.com/playlist?list=PL3rTBtU0TK_AS907SqaT3ndzUE8Q1FfO5