| 1. |
- Amselem, Elias, et al.
(author)
-
Experimental fully contextual correlations
-
Journal article (peer-reviewed)abstract
- Quantum correlations are contextual yet, in general, nothing prevents the existence of even morecontextual correlations. We identify and test a simple noncontextual inequality in which the quantumviolation cannot be improved by any hypothetical post-quantum resource, and use it to experimentally obtain correlations in which the maximum noncontextual content, defined as the maximumfraction of noncontextual correlations, is less than 0.06. Our correlations are experimentally generated from the outcomes of sequential compatible measurements on a four-state quantum system encoded in the polarization and path of a single photon.
|
|
| 2. |
- Amselem, Elias, et al.
(author)
-
Experimental fully contextual correlations
- 2012
-
In: Physical Review Letters. - 0031-9007 .- 1079-7114. ; 108:20, s. 200405-
-
Journal article (peer-reviewed)abstract
- Quantum correlations are contextual yet, in general, nothing prevents the existence of even more contextual correlations. We identify and test a noncontextuality inequality in which the quantum violation cannot be improved by any hypothetical postquantum theory, and use it to experimentally obtain correlations in which the fraction of noncontextual correlations is less than 0.06. Our correlations are experimentally generated from the results of sequential compatible tests on a four-state quantum system encoded in the polarization and path of a single photon.
|
|
| 3. |
- Cabello, Adan, et al.
(author)
-
Quantum social networks
- 2012
-
In: Journal of Physics A. - : IOP Publishing. - 1751-8113 .- 1751-8121. ; 45:28, s. 285101-
-
Journal article (peer-reviewed)abstract
- We introduce a physical approach to social networks (SNs) in which each actor is characterized by a yes-no test on a physical system. This allows us to consider SNs beyond those originated by interactions based on pre-existing properties, as in a classical SN (CSN). As an example of SNs beyond CSNs, we introduce quantum SNs (QSNs) in which actor i is characterized by a test of whether or not the system is in a quantum state |psi(i)>. We show that QSNs outperform CSNs for a certain task and some graphs. We identify the simplest of these graphs and show that graphs in which QSNs outperform CSNs are increasingly frequent as the number of vertices increases. We also discuss more general SNs and identify the simplest graphs in which QSNs cannot be outperformed.
|
|
