GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    In: Photonics Research, Optica Publishing Group, Vol. 10, No. 7 ( 2022-07-01), p. 1582-
    Abstract: A Hardy-like proof of quantum contextuality is a compelling way to see the conflict between quantum theory and noncontextual hidden variables (NCHVs), as the latter predict that a particular probability must be zero, while quantum theory predicts a nonzero value. For the existing Hardy-like proofs, the success probability tends to 1/2 when the number of measurement settings n goes to infinity. It means the conflict between the existing Hardy-like proof and NCHV theory is weak, which is not conducive to experimental observation. Here we advance the study of a stronger Hardy-like proof of quantum contextuality, whose success probability is always higher than the previous ones generated from a certain n -cycle graph. Furthermore, the success probability tends to 1 when n goes to infinity. We perform the experimental test of the Hardy-like proof in the simplest case of n = 7 by using a four-dimensional quantum system encoded in the polarization and orbital angular momentum of single photons. The experimental result agrees with the theoretical prediction within experimental errors. In addition, by starting from our Hardy-like proof, one can establish the stronger noncontextuality inequality, for which the quantum-classical ratio is higher with the same n , which provides a new method to construct some optimal noncontextuality inequalities. Our results offer a way for optimizing and enriching exclusivity graphs, helping to explore more abundant quantum properties.
    Type of Medium: Online Resource
    ISSN: 2327-9125
    Language: English
    Publisher: Optica Publishing Group
    Publication Date: 2022
    detail.hit.zdb_id: 2724783-1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...