A bound on the quantum value of all compiled nonlocal games

TL;DR

This paper proves a universal quantum soundness bound for all compiled two-player nonlocal games, linking the quantum value of the original game to that of the compiled protocol using operator algebra techniques.

Contribution

It establishes a general quantum soundness result for the cryptographic compiler applied to all nonlocal games, extending previous special-case results.

Findings

Quantum commuting operator value bounds the compiled game’s quantum value.

Operator algebra techniques are used to prove the bound.

Sequential characterization of quantum correlations is introduced.

Abstract

A cryptographic compiler introduced by Kalai et al. (STOC'23) converts any nonlocal game into an interactive protocol with a single computationally bounded prover. Although the compiler is known to be sound in the case of classical provers and complete in the quantum case, quantum soundness has so far only been established for special classes of games. In this work, we establish a quantum soundness result for all compiled two-player nonlocal games. In particular, we prove that the quantum commuting operator value of the underlying nonlocal game is an upper bound on the quantum value of the compiled game. Our result employs techniques from operator algebras in a computational and cryptographic setting to establish information-theoretic objects in the asymptotic limit of the security parameter. It further relies on a sequential characterization of quantum commuting operator correlations which may be of independent interest.