A computational proof of locality in entanglement
Han Geurdes

TL;DR
This paper presents a local hidden variables computer model that numerically violates the CHSH inequality, challenging traditional notions of locality in quantum entanglement.
Contribution
It introduces a computational proof of a local hidden variables model that can violate the CHSH inequality, providing new insights into quantum nonlocality.
Findings
The local model achieves CHSH ≈ 1 + √2.
The model demonstrates a violation of the CHSH inequality.
Numerical experiments support the model's validity.
Abstract
In this paper the design and proof of concept (POC) coding of a local hidden variables computer model is presented. The program violates the Clauser, Horne, Shimony and Holt inequality CHSH . In our numerical experiment, we find with our local computer program, CHSH .
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
TopicsComputability, Logic, AI Algorithms · Mathematical and Theoretical Analysis
