A bound on the quantum value of all compiled nonlocal games
arXiv:2408.06711 · doi:10.1145/3717823.3718237
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.
v3: 44 pages, 1 figure, extended introduction and added citations to related works
References in corpus (11)
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- Connes' embedding problem and Tsirelson's problem
- Tsirelson's problem and Kirchberg's conjecture
- Tsirelson's Problem and Asymptotically Commuting Unitary Matrices
- A physical approach to Tsirelson's problem
- An invertible map between Bell non-local and contextuality scenarios
- Non-closure of quantum correlation matrices and factorizable channels that require infinite dimensional ancilla
- A two-player dimension witness based on embezzlement, and an elementary proof of the non-closure of the set of quantum correlations
- Separation of quantum, spatial quantum, and approximate quantum correlations
- An operator-algebraic formulation of self-testing
- A bound on the quantum value of all compiled nonlocal games