Detecting Bell correlations in multipartite non-Gaussian spin states

• URL: http://arxiv.org/abs/2303.13499v1
• Date: Thu, 23 Mar 2023 17:57:05 GMT
• Title: Detecting Bell correlations in multipartite non-Gaussian spin states
• Authors: Jiajie Guo, Jordi Tura, Qiongyi He, Matteo Fadel
• Abstract summary: We introduce permutationally invariant Bell inequalities (PIBIs) involving few-body correlators. Compared to known inequalities, these show higher noise robustenss, or the capability to detect Bell correlations in highly non-Gaussian spin states. We formulate this search problem as a semidefinite program that embeds the constraints required to look for PIBIs of the desired form.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We expand the toolbox for studying Bell correlations in multipartite systems by introducing permutationally invariant Bell inequalities (PIBIs) involving few-body correlators. First, we present around twenty families of PIBIs with up to three- or four-body correlators, that are valid for arbitrary number of particles. Compared to known inequalities, these show higher noise robustenss, or the capability to detect Bell correlations in highly non-Gaussian spin states. We then focus on finding PIBIs that are of practical experimental implementation, in the sense that the associated operators require collective spin measurements along only a few directions. To this end, we formulate this search problem as a semidefinite program that embeds the constraints required to look for PIBIs of the desired form.

Related papers

• Three-outcome multipartite Bell inequalities: applications to dimension witnessing and spin-nematic squeezing in many-body systems [0.0]
  We show to be naturally suited to explore nonlocal correlations in many-body spin-1 systems or SU(3) models. In the specific, we show how to derive from this inequality experimentally practical Bell correlation witnesses based on the measurement of collective spin components. We show the application of these witnesses in spin-nematic squeezed states, such as the one that can be prepared in spin-1 Bose-Einstein condensates.
  arXiv  Detail & Related papers  (2024-06-18T17:44:44Z)
• 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)
• Inherent quantum resources in the stationary spin chains [0.0]
  We show that many-body Bell correlations are inherently present in the eigenstates of a variety of spin-1/2 chains. In particular, we show that the eigenstates and thermal states of the collective Lipkin-Meshkov-Glick model possess many-body Bell correlations.
  arXiv  Detail & Related papers  (2024-05-27T09:11:10Z)
• 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)
• Semi-device independent nonlocality certification for near-term quantum networks [46.37108901286964]
  Bell tests are the most rigorous method for verifying entanglement in quantum networks. If there is any signaling between the parties, then the violation of Bell inequalities can no longer be used. We propose a semi-device independent protocol that allows us to numerically correct for effects of correlations in experimental probability distributions.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• 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)
• One-axis twisting as a method of generating many-body Bell correlations [0.0]
  We show that the one-axis twisting (OAT) is a powerful source of many-body Bell correlations. We develop a fully analytical and universal treatment of the process, which allows us to identify the critical time at which the Bell correlations emerge, and predict the depth of Bell correlations at all subsequent times.
  arXiv  Detail & Related papers  (2022-06-21T17:16:37Z)
• Many-body Bell inequalities for bosonic qubits [0.0]
  This work is to analyze a set of Bell inequalities suitable for a possibly broad family of many-body systems. We develop a method that allows for a step-by-step study of the many-body Bell correlations.
  arXiv  Detail & Related papers  (2021-09-30T14:20:12Z)
• 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)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting [81.70513857417106]
  We design and analyze CascadeBAI, an algorithm for finding the best set of $K$ items. An upper bound on the time complexity of CascadeBAI is derived by overcoming a crucial analytical challenge. We show, through the derivation of a lower bound on the time complexity, that the performance of CascadeBAI is optimal in some practical regimes.
  arXiv  Detail & Related papers  (2020-01-23T16:47:52Z)

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.