Hardy's Paradox for Yu-Oh Set Constructed by Logically Contextual Quantum States
Chang He, Yongjun Wang, Baoshan Wang, Songyi Liu, Yunyi Jia

TL;DR
This paper constructs Hardy's paradoxes for the Yu-Oh set, a minimal state-independent contextual quantum system, demonstrating its contextuality through 12 paradoxes with an 11.1% success probability and proposing experimental observables.
Contribution
It systematically enumerates logically contextual pure states in the Yu-Oh set and constructs Hardy's paradoxes, advancing understanding of quantum contextuality in minimal systems.
Findings
Identified all logically contextual pure states in Yu-Oh set
Constructed 12 Hardy's paradoxes with 11.1% success probability
Proposed observables for experimental verification
Abstract
Quantum contextuality is a fundamental nonclassical property of quantum systems, regarded as a key resource that demonstrates the computational and informational advantages of quantum over classical systems. Our present work aims to construct Hardy's paradoxes, a set of possibilistic conditions witnessing contextuality, for Yu-Oh set, which is the state-independent contextual quantum system with the least number of vectors. To achieve the aim, we systematically enumerate all logically contextual pure states on Yu-Oh set, and theoretically prove that no mixed states in this scenario are logically contextual. Based on the identified logically contextual quantum states, we construct 12 Hardy's paradoxes with identical success probability SP=11.1%. Furthermore, we present corresponding observables to experimentally witness these Hardy's paradoxes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography
