The Setting
In parallel repetition, each player receives a full local question vector and returns an answer vector. The quantity at issue is the expected fraction of coordinates accepted by the base game’s verifier.
A two-player nonlocal game has finite nonempty question alphabets and answer alphabets , a question distribution on , and an acceptance predicate .✦
A finite probability law on a finite set is a function assigning nonnegative weights of total mass one; the expectation of a function on with values in a real vector space is the weighted sum in (1). (1)
A local positive operator-valued measure (POVM) on a finite-dimensional Hilbert space , with finite outcome alphabet , is a family of effects obeying (2). (2)✦
For a coefficient matrix on nonzero finite-dimensional local Hilbert spaces with orthonormal bases indexed by , the associated state vector is the vector in their tensor product given in (3), and its squared Hilbert-Schmidt norm is the sum given there. (3) For a coefficient matrix on and local operators on and on , the bipartite operator expectation is the complex scalar in (4), and the Born probability is its real part. (4) For and local POVMs , the joint measurement distribution is the probability law on outcome pairs with weight .✦
A single-round entangled strategy for the game is a normalized state on a pair of nonzero finite-dimensional local Hilbert spaces together with local POVMs for each . The Born probability of answers given questions for a single-round entangled strategy is the number given by .✦ The winning probability of a single-round entangled strategy for is its probability of acceptance, and the finite-dimensional entangled value of is the supremum of these winning probabilities over all finite-dimensional single-round entangled strategies, as given in (5). (5)
The Repeated Experiment
Let be a nonempty finite coordinate set and . The uniform law on and the product law of laws on indexed by a finite set have the weights in (6), where . (6)
A repeated quantum experiment for the game on the coordinate set is a collection consisting of the question law and verifier , a normalized coefficient matrix , and local POVMs on and on for every and .✦
A question profile for a repeated experiment on is a function assigning a question pair to each coordinate, with local vectors and .✦ A question and answer transcript for is a tuple consisting of a question profile and answer vectors with .✦ The conditional answer distribution of and its joint transcript distribution are the probability laws in (7). (7)
For a coordinate and transcript , the coordinate winning predicate is acceptance of by ; the coordinate winning indicator is the function on transcripts given by .✦ The winning fraction of a transcript is the uniform mean of these indicators, as in (8). (8)✦ For a tested set , the event that every tested coordinate wins, its subset winning indicator , and its joint winning probability are defined by (9). (9)
The Claim
Theorem 1. Let be a finite two-player game, a nonempty finite coordinate set of size , and a repeated quantum experiment for on . The mean rate obeys (10), with the singleton expression (11). (10)✦ (11)✦
In the paper, the result reads: for any finite-dimensional strategy for the -fold repetition of a finite two-prover game of entangled value , for every and ; in particular, if , every coordinate is lost almost surely.
What Is Checked
The claims (10) and (11) concern repeated quantum experiments for on nonempty finite , with expectations taken under the joint transcript law (7).