Avenues to generalising Bell inequalities

• URL: http://arxiv.org/abs/2202.06606v3
• Date: Wed, 20 Jul 2022 11:33:43 GMT
• Title: Avenues to generalising Bell inequalities
• Authors: Marcin Karczewski, Giovanni Scala, Antonio Mandarino, Ana Bel\'en Sainz, and Marek \.Zukowski
• Abstract summary: Using complex-valued correlation functions, we generalize their approach to a broader class of Bell scenarios. Although the resulting families of Bell inequalities are not always tight, their coefficients have an intuitively understandable structure.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Characterizing the set of all Bell inequalities is a notably hard task. An insightful method of solving it in case of Bell correlation inequalities for scenarios with two dichotomic measurements per site - for arbitrary number of parties - was given in Refs. [Phys. Rev. A 64, 010102(R) (2001)] and [Phys. Rev. A 64, 032112 (2001)]. Using complex-valued correlation functions, we generalize their approach to a broader class of Bell scenarios, in which the parties may choose from more than 2 multi-outcome measurements. Although the resulting families of Bell inequalities are not always tight, their coefficients have an intuitively understandable structure.We probe their usefulness by numerically testing their ability to detect Bell nonclassicality in simple interferometric experiments. Moreover, we identify a similar structure in the CGLMP inequality expressed in a correlation-based form, which allows us to generalise it to three parties.

Related papers

• Time series and the meaning of quantum non-locality [55.2480439325792]
  The derivation of Bell's inequalities gives precise meaning to the idea of quantum non-locality. It also makes evident why using it for faster than light signaling is impossible. It is demonstrated that series of outcomes, even if they violate Bell's inequalities, can be always embedded in a set of factual and counter-factual data.
  arXiv  Detail & Related papers  (2024-10-21T14:49:47Z)
• Deriving three-outcome permutationally invariant Bell inequalities [0.0]
  We present strategies to derive Bell inequalities valid for systems composed of many three-level parties. Our work can have interesting applications in the detection of Bell correlations in paradigmatic spin-1 models, as well as in experiments with solid-state systems or atomic ensembles.
  arXiv  Detail & Related papers  (2024-06-17T17:41:27Z)
• Optimal Bell inequalities for qubit-qudit systems [44.99833362998488]
  We evaluate the maximal Bell violation for a generic qubit-qudit system, obtaining easily computable expressions in arbitrary qudit dimension. We also give simple lower and upper bounds on that violation and study the possibility of improving the amount of Bell-violation by embedding the qudit Hilbert space in one of larger dimension.
  arXiv  Detail & Related papers  (2024-04-02T16:40:57Z)
• 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)
• Bell inequalities for nonlocality depth [0.0]
  When three or more particles are considered, quantum correlations can be stronger than correlations generated by so-called hybrid local hidden variable models. We provide an exhaustive classification of Bell inequalities to characterize various hybrid scenarios in four- and five-particle systems.
  arXiv  Detail & Related papers  (2022-05-09T13:03:03Z)
• An elegant proof of self-testing for multipartite Bell inequalities [0.0]
  This work presents a simple and broadly applicable self-testing argument for N-partite correlation Bell inequalities with two binary outcome observables per party. To showcase the versatility of our proof technique, we obtain self-testing statements for N party Mermin-Ardehali-Bei-Klyshko (MABK) and Werner-Wolf-Weinfurter-.Zukowski-Brukner (WWW.ZB) family of linear Bell inequalities.
  arXiv  Detail & Related papers  (2022-02-14T18:00:50Z)
• Generalized Iterative Formula for Bell Inequalities [12.55611325152539]
  This work is inspired via a decomposition of $(n+1)$-partite Bell inequalities into $n$-partite ones. We present a generalized iterative formula to construct nontrivial $(n+1)$-partite ones from the $n$-partite ones.
  arXiv  Detail & Related papers  (2021-09-12T14:02:13Z)
• 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)
• Functional Regularization for Representation Learning: A Unified Theoretical Perspective [27.93916012334704]
  Unsupervised and self-supervised learning approaches have become a crucial tool to learn representations for downstream prediction tasks. We present a unifying perspective where several such approaches can be viewed as imposing a regularization on the representation via a learnable function using unlabeled data. We propose a discriminative theoretical framework for analyzing the sample complexity of these approaches, which generalizes the framework of (Balcan and Blum, 2010) to allow learnable regularization functions.
  arXiv  Detail & Related papers  (2020-08-06T04:06:04Z)
• Generalizing optimal Bell inequalities [0.0]
  Bell inequalities are central tools for studying nonlocal correlations and their applications in quantum information processing. We develop a method to characterize Bell inequalities under constraints, which may be given by symmetry or other linear conditions. This allows to search systematically for generalizations of given Bell inequalities to more parties.
  arXiv  Detail & Related papers  (2020-05-18T13:11:02Z)
• Generalised Lipschitz Regularisation Equals Distributional Robustness [47.44261811369141]
  We give a very general equality result regarding the relationship between distributional robustness and regularisation. We show a new result explicating the connection between adversarial learning and distributional robustness.
  arXiv  Detail & Related papers  (2020-02-11T04:19:43Z)

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.