Improved local models and new Bell inequalities via Frank-Wolfe algorithms
arXiv:2302.04721 · doi:10.1103/PhysRevResearch.5.043059
Abstract
In Bell scenarios with two outcomes per party, we algorithmically consider the two sides of the membership problem for the local polytope: constructing local models and deriving separating hyperplanes, that is, Bell inequalities. We take advantage of the recent developments in so-called Frank-Wolfe algorithms to significantly increase the convergence rate of existing methods. As an application, we study the threshold value for the nonlocality of two-qubit Werner states under projective measurements. Here, we improve on both the upper and lower bounds present in the literature. Importantly, our bounds are entirely analytical; moreover, they yield refined bounds on the value of the Grothendieck constant of order three: . We also demonstrate the efficiency of our approach in multipartite Bell scenarios, and present the first local models for all projective measurements with visibilities noticeably higher than the entanglement threshold. We make our entire code accessible as a Julia library called BellPolytopes.jl.
16 pages, 3 figures. v4: erratum (multipartite results and Lemma 2)
References in corpus (21)
- Bell nonlocality
- Bell's theorem for general N-qubit states
- Classification of multi-qubit mixed states: separability and distillability properties
- Grothendieck's constant and local models for noisy entangled quantum states
- Simulating positive-operator-valued measures with projective measurements
- More efficient Bell inequalities for Werner states
- Family of Zeilinger-Horne-Greenberger "W" states lead to stronger nonclassicality than family of Greenberger-Horne-Zeilinger "GHZ" states
- Better local hidden variable models for two-qubit Werner states and an upper bound on the Grothendieck constant
- General method for constructing local-hidden-variable models for entangled quantum states
- Algorithmic construction of local hidden variable models for entangled quantum states
- On the Relationship between Convex Bodies Related to Correlation Experiments with Dichotomic Observables
- Bell nonlocality is not sufficient for the security of standard device-independent quantum key distribution protocols
- Convex optimization over classes of multiparticle entanglement
- Non-classicality thresholds for multiqubit states - numerical analysis
- Qutrit witness from the Grothendieck constant of order four
- A study of separability criteria for mixed three-qubit states
- Towards Grothendieck Constants and LHV Models in Quantum Mechanics
- Optimal tests of genuine multipartite nonlocality
- From Bell Inequalities to Tsirelson's Theorem: A Survey
- More non-locality in the three-qubit Greenberger-Horne-Zeilinger state
- Certification of qubits in the prepare-and-measure scenario with large input alphabet and connections with the Grothendieck constant
Cited by in corpus (15)
- Semidefinite programming relaxations for quantum correlations
- Exact Steering Bound for Two-Qubit Werner States
- Compatibility of Generalized Noisy Qubit Measurements
- Scalable entanglement certification via quantum communication
- Nonlocality activation in a photonic quantum network
- Symmetric multipartite Bell inequalities via Frank-Wolfe algorithms
- Human-AI Co-Creativity: Exploring Synergies Across Levels of Creative Collaboration
- Discovering Local Hidden-Variable Models for Arbitrary Multipartite Entangled States and Arbitrary Measurements
- Detecting genuine multipartite entanglement using moments of positive maps
- Certifying measurement incompatibility in prepare-and-measure and Bell scenarios
- Improved algorithms and novel applications of the FrankWolfe.jl library
- Weak entanglement improves quantum communication using only product measurements
- Revealing the Boundary between Quantum Mechanics and Classical Model by EPR-Steering Inequality
- Classical bounds on two-outcome bipartite Bell expressions and linear prepare-and-measure witnesses: Efficient computation in parallel environments such as graphics processing units
- Better bounds on finite-order Grothendieck constants