The Iteration Formula of (n,2,d) Full-correlated Multi-component Bell Function and Its Applications

• URL: http://arxiv.org/abs/2311.03681v1
• Date: Tue, 7 Nov 2023 03:16:11 GMT
• Title: The Iteration Formula of (n,2,d) Full-correlated Multi-component Bell Function and Its Applications
• Authors: Hui-Xian Meng, Yu Zhang, Xing-Yan Fan, Jie Zhou, Wei-Min Shang, and Jing-Ling Chen
• Abstract summary: It is very difficult to construct Bell inequalities for n-partite, k-settings of measurement, and d-dimensional (n,k,d) systems. Inspired by the iteration formula form of the Mermin-Ardehali-Belinskiui-Klyshko (MABK) inequality, we generalize the multi-component correlation functions for bipartite d-dimensional systems to n-partite ones.
• Score: 17.388141022537273
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is very difficult and important to construct Bell inequalities for n-partite, k-settings of measurement, and d-dimensional (n,k,d) systems. Inspired by the iteration formula form of the Mermin-Ardehali-Belinski{\u{\i}}-Klyshko (MABK) inequality, we generalize the multi-component correlation functions for bipartite d-dimensional systems to n-partite ones, and construct the corresponding Bell inequality. The Collins-Gisin-Linden-Massar-Popescu inequality can be reproduced by this way. The most important result is that for prime d the general Bell function in full-correlated multi-component correlation function form for (n,2,d) systems can be reformulated in iteration formula by two full-correlated multi-component Bell functions for (n-1,2,d) systems. As applications, we recover the MABK inequality and the most robust coincidence Bell inequalities for (3,2,3),(4,2,3),(5,2,3), and (3,2,5) Bell scenarios with this iteration formula. This implies that the iteration formula is an efficient way of constructing multi-partite Bell inequalities. In addition, we also give some new Bell inequalities with the same robustness but inequivalent to the known ones.

Related papers

• SOS decomposition for general Bell inequalities in two qubits systems and its application to quantum randomness [7.873333768393128]
  Bell non-locality is closely related with device independent quantum randomness. We present a kind of sum-of-squares (SOS) decomposition for general Bell inequalities in two qubits systems.
  arXiv  Detail & Related papers  (2024-09-13T01:43:32Z)
• Bell Nonlocality from Wigner Negativity in Qudit Systems [1.2499537119440245]
  We show that Wigner negativity is necessary for nonlocality in qudit systems. We propose a family of Bell inequalities that inquire correlations related to Wigner negativity of stabilizer states.
  arXiv  Detail & Related papers  (2024-05-23T09:44:36Z)
• 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)
• Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting [64.0722630873758]
  We consider rather general and broad class of Markov chains, Ito chains, that look like Euler-Maryama discretization of some Differential Equation. We prove the bound in $W_2$-distance between the laws of our Ito chain and differential equation.
  arXiv  Detail & Related papers  (2023-10-09T18:38:56Z)
• 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)
• Avenues to generalising Bell inequalities [0.0]
  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.
  arXiv  Detail & Related papers  (2022-02-14T10:49:23Z)
• Why Should I Trust You, Bellman? The Bellman Error is a Poor Replacement for Value Error [83.10489974736404]
  We study the use of the Bellman equation as a surrogate objective for value prediction accuracy. We find that the Bellman error is a poor proxy for the accuracy of the value function.
  arXiv  Detail & Related papers  (2022-01-28T21:03:59Z)
• 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)
• Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
  We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range. For a large part of the presentation, infinite scattering length will be considered.
  arXiv  Detail & Related papers  (2020-06-03T17:54:43Z)
• Constructing Multipartite Bell inequalities from stabilizers [21.98685929768227]
  We propose a systematical framework to construct Bell inequalities from stabilizers maximally violated by general stabilizer states. We show that the constructed Bell inequalities can self-test any stabilizer state which is essentially device-independent. Our framework can not only inspire more fruitful multipartite Bell inequalities from conventional verification methods, but also pave the way for their practical applications.
  arXiv  Detail & Related papers  (2020-02-05T16:07:11Z)
• 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.