Simplest bipartite perfect quantum strategies
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915088292642816 |
|---|---|
| author | Cabello, Adán |
| author_facet | Cabello, Adán |
| contents | A bipartite perfect quantum strategy (BPQS) allows two players who cannot communicate with each other to always win a nonlocal game. BPQSs are rare but fundamental in light of some recent results in quantum information, computation, and foundations. A more than 40-year-old open problem is how many inputs (measurement settings) a BPQS requires. A related problem is how many inputs are needed if, in addition, the quantum system has minimum dimension. A third, apparently unrelated, problem is what is the connection between BPQSs and state-independent contextuality, which inspired the first BPQSs. Here, we solve the third problem: we prove that {\em every} BPQS defines a Kochen-Specker set. We use this result to identify the BPQS with the smallest number of inputs, both in the general case and in the case of minimum dimension, and solve some related problems. We conjecture that the BPQSs presented here are the solutions to the first two problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_17735 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Simplest bipartite perfect quantum strategies Cabello, Adán Quantum Physics A bipartite perfect quantum strategy (BPQS) allows two players who cannot communicate with each other to always win a nonlocal game. BPQSs are rare but fundamental in light of some recent results in quantum information, computation, and foundations. A more than 40-year-old open problem is how many inputs (measurement settings) a BPQS requires. A related problem is how many inputs are needed if, in addition, the quantum system has minimum dimension. A third, apparently unrelated, problem is what is the connection between BPQSs and state-independent contextuality, which inspired the first BPQSs. Here, we solve the third problem: we prove that {\em every} BPQS defines a Kochen-Specker set. We use this result to identify the BPQS with the smallest number of inputs, both in the general case and in the case of minimum dimension, and solve some related problems. We conjecture that the BPQSs presented here are the solutions to the first two problems. |
| title | Simplest bipartite perfect quantum strategies |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2311.17735 |