Hardy nonlocality for entangled pairs in a four-particle system
Duc Manh Doan, Hung Q. Nguyen

TL;DR
This paper explores Hardy's nonlocality in a four-particle cyclic entanglement system, revealing more conditions for nonlocality than fully entangled states, through theoretical analysis and quantum circuit simulations on IBM hardware.
Contribution
It introduces a novel cyclic entanglement configuration for Hardy's nonlocality, expanding understanding beyond fully entangled systems with practical circuit implementation.
Findings
Larger set of nonlocality conditions identified
Simulation results show correlation patterns consistent with theory
Experimental implementation on IBM Brisbane shows deviations from ideal predictions
Abstract
Nonlocality can be studied through different approaches, such as Bell's inequalities, and it can be found in numerous quantum states, including GHZ states or graph states. Hardy's paradox, or Hardy-type nonlocality, provides a way to investigate nonlocality for entangled states of particles without using inequalities. Previous studies of Hardy's nonlocality have mostly focused on the fully entangled systems, while other entanglement configurations remain less explored. In this work, the system under investigation consists of four particles arranged in a cyclic entanglement configuration, where each particle forms entangled pairs with two neighbors, while non-neighboring particles remain unentangled. We found that this entanglement structure offers a larger set of conditions that lead to the contradiction with the LHV model, compared to the fully entangled systems. This enhancement can…
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 Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
