Local hidden variable values without optimization procedures

• URL: http://arxiv.org/abs/2004.00695v4
• Date: Thu, 26 Jan 2023 14:37:50 GMT
• Title: Local hidden variable values without optimization procedures
• Authors: Dardo Goyeneche, Wojciech Bruzda, Ond\v{r}ej Turek, Daniel Alsina, Karol \.Zyczkowski
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The problem of computing the local hidden variable (LHV) value of a Bell inequality plays a central role in the study of quantum nonlocality. In particular, this problem is the first step towards characterizing the LHV polytope of a given scenario. In this work, 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. We show infinite families of bipartite Bell inequalities for which the LHV value can be computed exactly, without needing to solve any optimization problem, for any number of measurement settings. We also find tight Bell inequalities for a large number of measurement settings.

Related papers

• Effects of Topological Boundary Conditions on Bell Nonlocality [0.9374652839580183]
  Bell nonlocality is the resource that enables device-independent quantum information processing tasks. Our work can act as a guide to certify Bell nonlocality in many-qubit devices.
  arXiv  Detail & Related papers  (2024-05-23T13:58:50Z)
• Robust self-testing of Bell inequalities tilted for maximal loophole-free nonlocality [1.099532646524593]
  quantum strategies attain the maximal loophole-free nonlocality in the presence of inefficient detectors. We use a novel Jordan's lemma-based proof technique to obtain robust analytical self-testing statements for the entire family of tilted-Bell inequalities.
  arXiv  Detail & Related papers  (2024-05-14T16:31:06Z)
• Double Duality: Variational Primal-Dual Policy Optimization for Constrained Reinforcement Learning [132.7040981721302]
  We study the Constrained Convex Decision Process (MDP), where the goal is to minimize a convex functional of the visitation measure. Design algorithms for a constrained convex MDP faces several challenges, including handling the large state space.
  arXiv  Detail & Related papers  (2024-02-16T16:35:18Z)
• 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)
• Bell inequalities with overlapping measurements [52.81011822909395]
  We study Bell inequalities where measurements of different parties can have overlap. This allows to accommodate problems in quantum information. The scenarios considered show an interesting behaviour with respect to Hilbert space dimension, overlap, and symmetry.
  arXiv  Detail & Related papers  (2023-03-03T18:11:05Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Design of optimization tools for quantum information theory [0.0]
  We introduce an algorithm for quantum estate estimation and a technique for certifying quantum non-locality. To study the quantum marginal problem, we develop an algorithm, which takes as inputs a set of quantum marginals and eigenvalues, and outputs a density matrix.
  arXiv  Detail & Related papers  (2022-04-15T19:37:21Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields [53.31927549039624]
  We show that a piecewise discretization preserves better contrast from existing discretization problems. We apply this theory to the problem of matching two images.
  arXiv  Detail & Related papers  (2021-07-13T12:31:06Z)
• Bell nonlocality with a single shot [0.0]
  We show that to obtain a small expected p-value it is sufficient to have a large gap between the local and Tsirelson bounds of the Bell inequality. We present explicit examples of Bell inequalities with gap arbitrarily close to one, and show that this makes it possible to reject local hidden variables in a single shot.
  arXiv  Detail & Related papers  (2020-05-27T15:23:40Z)
• Einselection from incompatible decoherence channels [62.997667081978825]
  We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators. We show that Fock states remain the most robust states to decoherence up to a critical coupling.
  arXiv  Detail & Related papers  (2020-01-29T14:15:19Z)

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.