Quantum bounds for compiled XOR games and $d$-outcome CHSH games
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917048256299008 |
|---|---|
| author | Baroni, Matilde Vu, Quoc-Huy Bourdoncle, Boris Diamanti, Eleni Markham, Damian Šupić, Ivan |
| author_facet | Baroni, Matilde Vu, Quoc-Huy Bourdoncle, Boris Diamanti, Eleni Markham, Damian Šupić, Ivan |
| contents | Nonlocal games play a crucial role in quantum information theory and have numerous applications in certification and cryptographic protocols. Kalai et al. (STOC 2023) introduced a procedure to compile a nonlocal game into a single-prover interactive proof, using a quantum homomorphic encryption scheme, and showed that their compilation method preserves the classical bound of the game. Natarajan and Zhang (FOCS 2023) then showed that the quantum bound is preserved for the specific case of the CHSH game. Extending the proof techniques of Natarajan and Zhang, we show that the compilation procedure of Kalai et al. preserves the quantum bound for two classes of games: XOR games and d-outcome CHSH games. We also establish that, for any pair of qubit measurements, there exists an XOR game such that its optimal winning probability serves as a self-test for that particular pair of measurements. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_05502 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum bounds for compiled XOR games and $d$-outcome CHSH games Baroni, Matilde Vu, Quoc-Huy Bourdoncle, Boris Diamanti, Eleni Markham, Damian Šupić, Ivan Quantum Physics Nonlocal games play a crucial role in quantum information theory and have numerous applications in certification and cryptographic protocols. Kalai et al. (STOC 2023) introduced a procedure to compile a nonlocal game into a single-prover interactive proof, using a quantum homomorphic encryption scheme, and showed that their compilation method preserves the classical bound of the game. Natarajan and Zhang (FOCS 2023) then showed that the quantum bound is preserved for the specific case of the CHSH game. Extending the proof techniques of Natarajan and Zhang, we show that the compilation procedure of Kalai et al. preserves the quantum bound for two classes of games: XOR games and d-outcome CHSH games. We also establish that, for any pair of qubit measurements, there exists an XOR game such that its optimal winning probability serves as a self-test for that particular pair of measurements. |
| title | Quantum bounds for compiled XOR games and $d$-outcome CHSH games |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2403.05502 |