2003/02/14 by A. F. Kracklauer, Kracklauer, A. F.
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0302113
9p. LaTeX, 1 fig. eps; v2: fixed misleading/wrong statements about relationship between this work & popular views
openalex publication_date 2003/02/14 · arxiv created 2004/03/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
As part of a challenge to critics of Bell's analysis of the EPR argument, framed in the form of a bet, R. D. Gill formulated criteria to assure that all non-locality is precluded from simulation-algorithms used to test Bell's theorem. This is achieved in part by parceling out the subroutines for the source and both detectors to three separate computers. He argues that, in light of Bell's theorem, following these criteria absolutely precludes mimicking EPR-B correlations as computed with Quantum Mechanics and observed in experiments. Herein, nevertheless, we describe just such an local algorithm, fully faithful to his criteria, that yields results mimicking exactly quantum correlations. We observe that our simulation-algorithm succeeds by altering an implicit assumption made by Bell to the equivalent effect that the source of EPR pairs is a single Poisson process followed by deterministic detection. Instead we assume the converse, namely that the source is deterministic but detection involves multiple, independent Poisson processes, one at each detector with an intensity given by Malus' Law. Finally, we speculate on some consequences this might have for quantum computing algorithms.