The Setting
Threshold parallel repetition concerns the probability of exceeding a game’s single-round entangled value over many coordinates. Each player receives a string of questions and returns a string of answers.
Let be finite nonempty question alphabets and finite nonempty answer alphabets. Write for the repetition length, and use bold letters for strings of length .
The Definition
Definition 1. A finite two-player game on is a pair consisting of a question probability distribution and an acceptance function , with (1)✦ Acceptance in (1) means .
A finite-dimensional entangled strategy for question sets and answer alphabets consists of a unit bipartite state and a local positive operator-valued measurement for each question, as specified by (2)✦ The conditions in (2) hold for every question and answer; denote the set of these strategies by . A single-round strategy for is an element of .✦
The Born probability of answers for questions under is the expectation (3)✦ The winning probability of a single-round strategy is the accepted probability from (3), averaged over the referee’s questions: (4)✦ The finite-dimensional entangled value of is the supremum of the winning probabilities in (4) over all single-round strategies: (5)✦
A joint -fold strategy for is an element of the strategy set in (6), whose questions and answers are strings: (6)✦ The number of wins at a transcript is the coordinate count (7)✦
Let , with representing a positive excess over (5). The threshold success probability of a joint strategy is the probability that the count in (7) reaches the ceiling threshold under independently sampled question pairs: (8)✦ The threshold game value is the supremum of the probabilities in (8) over all joint -fold strategies: (9)✦
What Is Checked
The definitions (1) to (9) are stated over finite nonempty game alphabets, unit states on finite-dimensional bipartite spaces and local positive operator-valued measurements, for every repetition length and real threshold parameter .