Quantum parallel repetition plays 
independent copies of a two-player entangled game and accepts
only when the players win every copy. In one copy of such a game, a referee sends
one question to each of two noncommunicating players and decides whether they win
from their answers. The players may share an entangled quantum state before play,
and the supremum of their winning probabilities is the entangled value 
.
Raz (1998) proved exponential parallel repetition for classical games, while Yuen (2016) obtained polynomial decay for arbitrary entangled games.
Let 
be any finite two-player, one-round entangled game with nonempty answer alphabets
and 
,
and write 
.
An AI-generated proof given by OpenAI (2026) established that there is a universal
constant 
such that
 |
for every integer 
. Thus the entangled value has exponential
decay for every such game. This proves the quantum parallel repetition conjecture
for all finite two-player, one-round games. The exponent 13 is not claimed to be
optimal.
