Improved local models and new Bell inequalities via Frank-Wolfe algorithms

• URL: http://arxiv.org/abs/2302.04721v3
• Date: Wed, 18 Oct 2023 14:24:27 GMT
• Title: Improved local models and new Bell inequalities via Frank-Wolfe algorithms
• Authors: S\'ebastien Designolle, Gabriele Iommazzo, Mathieu Besan\c{c}on, Sebastian Knebel, Patrick Gel{\ss}, and Sebastian Pokutta
• Abstract summary: In Bell scenarios with two outcomes per party, we algorithmically consider the two sides of the membership problem for the local polytope. We take advantage of the recent developments in so-called Frank-Wolfe algorithms to significantly increase the convergence rate of existing methods. We present the first local models for all projective measurements with visibilities noticeably higher than the entanglement threshold.
• Score: 16.159626741758633
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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: $1.4367\leqslant K_G(3)\leqslant1.4546$. 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.

Related papers

• A Riemannian Approach to the Lindbladian Dynamics of a Locally Purified Tensor Network [0.0]
  We propose a framework for implementing Lindbladian dynamics in many-body open quantum systems with nearest-neighbor couplings. In this work, we leverage the gauge freedom inherent in the Kraus representation of quantum channels to improve the splitting error. We validate our approach using two nearest-neighbor noise models and achieve an improvement of orders of magnitude compared to other positivity-preserving schemes.
  arXiv  Detail & Related papers  (2024-09-12T15:16:15Z)
• Symmetric multipartite Bell inequalities via Frank-Wolfe algorithms [22.554728415868574]
  We study the nonlocality robustness of the Greenberger-Horne-Zeilinger (GHZ) state in multipartite Bell scenarios. We exploit the symmetry of the resulting correlation tensor to drastically accelerate the computation of a Bell inequality.
  arXiv  Detail & Related papers  (2023-10-31T17:43:59Z)
• First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities [91.46841922915418]
  We present a unified approach for the theoretical analysis of first-order variation methods. Our approach covers both non-linear gradient and strongly Monte Carlo problems. We provide bounds that match the oracle strongly in the case of convex method optimization problems.
  arXiv  Detail & Related papers  (2023-05-25T11:11:31Z)
• Proofs of network quantum nonlocality aided by machine learning [68.8204255655161]
  We show that the family of quantum triangle distributions of [DOI40103/PhysRevLett.123.140] did not admit triangle-local models in a larger range than the original proof. We produce a large collection of network Bell inequalities for the triangle scenario with binary outcomes, which are of independent interest.
  arXiv  Detail & Related papers  (2022-03-30T18:00:00Z)
• Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks [79.16773494166644]
  We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network. We design two optimal algorithms that attain these lower bounds. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-08T15:54:44Z)
• Bounding the detection efficiency threshold in Bell tests using multiple copies of the maximally entangled two-qubit state carried by a single pair of particles [0.0]
  We investigate the critical efficiency of detectors to observe Bell nonlocality using multiple copies of the maximally entangled two-qubit state carried by a single pair of particles. We show analytically that the symmetric detection efficiency threshold decays exponentially with the number of copies of the two-qubit state.
  arXiv  Detail & Related papers  (2021-03-18T17:48:08Z)
• Hybrid Trilinear and Bilinear Programming for Aligning Partially Overlapping Point Sets [85.71360365315128]
  In many applications, we need algorithms which can align partially overlapping point sets are invariant to the corresponding corresponding RPM algorithm. We first show that the objective is a cubic bound function. We then utilize the convex envelopes of trilinear and bilinear monomial transformations to derive its lower bound. We next develop a branch-and-bound (BnB) algorithm which only branches over the transformation variables and runs efficiently.
  arXiv  Detail & Related papers  (2021-01-19T04:24:23Z)
• An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits [129.1029690825929]
  We introduce a novel algorithm improving over the state-of-the-art along multiple dimensions. We establish minimax optimality for any learning horizon in the special case of non-contextual linear bandits.
  arXiv  Detail & Related papers  (2020-10-23T09:12:47Z)
• Linear semi-infinite programming approach for entanglement quantification [0.0]
  We show the absence of a duality gap between primal and dual problems, even if the entanglement quantifier is not continuous. We implement a central cutting-plane algorithm for LSIP to quantify entanglement between three qubits.
  arXiv  Detail & Related papers  (2020-07-27T19:12:29Z)
• Local hidden variable values without optimization procedures [0.0]
  We establish a relation between the LHV value of bipartite Bell inequalities and the mathematical notion of excess of a matrix. Inspired by the well developed theory of excess, we derive several results that directly impact the field of quantum nonlocality.
  arXiv  Detail & Related papers  (2020-04-01T20:29:47Z)
• Lagrangian Decomposition for Neural Network Verification [148.0448557991349]
  A fundamental component of neural network verification is the computation of bounds on the values their outputs can take. We propose a novel approach based on Lagrangian Decomposition. We show that we obtain bounds comparable with off-the-shelf solvers in a fraction of their running time.
  arXiv  Detail & Related papers  (2020-02-24T17:55:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.