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

Abstract

We demonstrate that parallel repetition of the multiplayer anchored optimal value, ω ( G ) 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).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…