A computational proof of locality in entanglement
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| ≤ 2. In our numerical experiment, we find with our local computer program, CHSH ≈ 1 + 2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.