Beating one bit of communication with quantum correlations in smaller dimensions
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913391030829056 |
|---|---|
| author | Sidajaya, Peter Scarani, Valerio |
| author_facet | Sidajaya, Peter Scarani, Valerio |
| contents | As a consequence of Bell's theorem, the statistics of measurements on some entangled states cannot be simulated with local hidden variables alone. The amount of communication that must be supplied is an intuitive quantifier of nonclassicality. While it is obvious that this amount can be very large in general, it has been surprisingly difficult to find simple examples of quantum correlations, whose simulation requires more than one bit of communication. In this paper, we report the simplest example to date, which lives in the $(5,2,5,5)$ Bell scenario [the previously known smallest case living in the $(7,3,16,16)$ scenario]. The proof is built on the observation that finding the largest 1-bit score is equivalent to finding the bipartition of the inputs, in which the sum of the local scores of the two subgames is maximal. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_02723 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Beating one bit of communication with quantum correlations in smaller dimensions Sidajaya, Peter Scarani, Valerio Quantum Physics As a consequence of Bell's theorem, the statistics of measurements on some entangled states cannot be simulated with local hidden variables alone. The amount of communication that must be supplied is an intuitive quantifier of nonclassicality. While it is obvious that this amount can be very large in general, it has been surprisingly difficult to find simple examples of quantum correlations, whose simulation requires more than one bit of communication. In this paper, we report the simplest example to date, which lives in the $(5,2,5,5)$ Bell scenario [the previously known smallest case living in the $(7,3,16,16)$ scenario]. The proof is built on the observation that finding the largest 1-bit score is equivalent to finding the bipartition of the inputs, in which the sum of the local scores of the two subgames is maximal. |
| title | Beating one bit of communication with quantum correlations in smaller dimensions |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2402.02723 |