Values for compiled XOR nonlocal games

          @misc{ pirsa_PIRSA:24040093,
            doi = {10.48660/24040093},
            url = {https://pirsa.org/24040093},
            author = {Paddock, Connor},
            keywords = {Quantum Information},
            language = {en},
            title = {Values for compiled XOR nonlocal games},
            publisher = {Perimeter Institute},
            year = {2024},
            month = {apr},
            note = {PIRSA:24040093 see, \url{https://pirsa.org}}
          }
          

Abstract

Nonlocal games are a foundational tool for understanding entanglement and constructing quantum protocols in settings with multiple spatially separated quantum devices. However, the spatial separation between devices can be difficult to enforce in practice. To this end, Kalai et al. (STOC '23) initiated the study of compiled nonlocal games. The KLVY compilation procedure transforms any k-prover nonlocal into a game with a classical verifier and a single cryptographically limited quantum prover. Kalai et al. showed that their compilation procedure is sound against classical provers and complete for entangled provers. Natarajan and Zhang (FOCS '23) showed that the compiled two-prover CHSH game is sound against quantum provers. I will discuss recent work, showing that the compiler is sound for any two-player XOR game. I will also discuss challenges and open questions in extending results from nonlocal games to the compiled setting.