Maximum Bell Violations via Genetic Algorithm Search
T. A. Osborn, Adam Rogers

TL;DR
This paper employs a genetic algorithm to optimize measurement settings in Bell inequality experiments, identifying quantum extremes and bounds for various matrix configurations, advancing understanding of quantum non-locality.
Contribution
It introduces a genetic algorithm approach to find measurement operators that maximize Bell violations, extending analysis to a class of weight matrices with specific structural properties.
Findings
GA finds measurement settings reaching quantum bounds for N=2 to 10.
Maximum Bell violations are between the Bell threshold and quantum bound.
Zero quantum gap matrices are characterized by row and column sum criteria.
Abstract
Bell inequality experiments measure the correlation coefficients of two spatially separated systems. In an EPR setup, at one location Alice has observables while at a second remote location Bob has observables . Within this bipartite environment each real weight matrix constructs a Bell operator defined by the sum of . Operator has the Bell non-locality boundary given by a hidden variable norm of . As the composition varies, quantum extremes arise when the operator norm has the greatest possible Bell violation. A genetic algorithm (GA) search over all is used to find examples of the Alice and Bob operators that realize quantum extremes. A class of weights of special interest is given by the…
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 Information and Cryptography · Advanced Thermodynamics and Statistical Mechanics
