Tight Bell inequalities from polytope slices

• URL: http://arxiv.org/abs/2212.03212v3
• Date: Wed, 12 Jul 2023 21:22:01 GMT
• Title: Tight Bell inequalities from polytope slices
• Authors: Jos\'e Jesus and Emmanuel Zambrini Cruzeiro
• Abstract summary: We derive new tight bipartite Bell inequalities for various scenarios. We identify scenarios which perform better in terms of visibility, resistance to noise, or both, when compared to CHSH.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We derive new tight bipartite Bell inequalities for various scenarios. A bipartite Bell scenario $(X,Y,A,B)$ is defined by the numbers of settings and outcomes per party, $X$, $A$ and $Y$, $B$ for Alice and Bob, respectively. We derive the complete set of facets of the local polytopes of $(6,3,2,2)$, $(3,3,3,2)$, $(3,2,3,3)$, and $(2,2,3,5)$. We provide extensive lists of facets for $(2,2,4,4)$, $(3,3,4,2)$ and $(4,3,3,2)$. For each inequality we compute the maximum quantum violation, the resistance to noise, and the minimal symmetric detection efficiency required to close the detection loophole, for qubits, qutrits and ququarts. Based on these results, we identify scenarios which perform better in terms of visibility, resistance to noise, or both, when compared to CHSH. Such scenarios could find important applications in quantum communication.

Related papers

• Experimental demonstration of the Bell-type inequalities for four qubit Dicke state using IBM Quantum Processing Unit [5.361677484495031]
  We theoretically evaluate the Bell-type violation for the two-qubit Bell state and a four-qubit Dicke state. For Dicke state, we found the violation be to $2.1239pm0.0457$ and $2.2175pm0.0352$ respectively for two distinct methods of state preparation.
  arXiv  Detail & Related papers  (2024-10-26T18:04:06Z)
• Generating multipartite nonlocality to benchmark quantum computers [0.0]
  We show that quantum computers can be used for producing large $n$-partite nonlocality. This allows in return to benchmark nonclassical correlations regardless of the number of qubits or the connectivity.
  arXiv  Detail & Related papers  (2024-06-11T19:03:35Z)
• Sharing nonlocality in a network using the quantum violation of chain network inequality [0.9948874862227255]
  Based on the quantum violation of suitable $n$-local inequality in a star network for arbitrary $m$ inputs, we demonstrate the sharing of nonlocality in the network. We consider two different types of sharing of nonlocality in the network.
  arXiv  Detail & Related papers  (2023-11-08T06:50:41Z)
• Succinct quantum testers for closeness and $k$-wise uniformity of probability distributions [2.3466828785520373]
  We explore potential quantum speedups for the fundamental problem of testing the properties of closeness and $k$-wise uniformity of probability distributions. We show that the quantum query complexities for $ell1$- and $ell2$-closeness testing are $O(sqrtn/varepsilon)$ and $O(sqrtnk/varepsilon)$. We propose the first quantum algorithm for this problem with query complexity $O(sqrtnk/varepsilon)
  arXiv  Detail & Related papers  (2023-04-25T15:32:37Z)
• Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end [114.3957763744719]
  We present a quantum algorithm that has rigorous runtime guarantees for several families of binary optimization problems. We show that the algorithm finds the optimal solution in time $O*(2(0.5-c)n)$ for an $n$-independent constant $c$. We also show that for a large fraction of random instances from the $k$-spin model and for any fully satisfiable or slightly frustrated $k$-CSP formula, statement (a) is the case.
  arXiv  Detail & Related papers  (2022-12-03T02:45:23Z)
• Testing entanglement and Bell inequalities in $H \to ZZ$ [0.0]
  We discuss quantum entanglement and violation of Bell inequalities in the $Hrightarrow ZZ$ decay. We derive sufficient and necessary conditions for entanglement in terms of only two parameters. The sensitivity to a violation of the Bell inequalities is at the $4.5sigma$ level.
  arXiv  Detail & Related papers  (2022-09-27T14:59:29Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Nearly Minimax Optimal Reward-free Reinforcement Learning [88.75843804630772]
  We study the reward-free reinforcement learning framework, which is particularly suitable for batch reinforcement learning and scenarios where one needs policies for multiple reward functions. We give a new efficient algorithm, textbfStaged textbfSampling + textbfTruncated textbfPlanning (algoname), which interacts with the environment at most $Oleft( fracS2Aepsilon2textpolylogleft(fracSAHepsilon2
  arXiv  Detail & Related papers  (2020-10-12T17:51:19Z)
• An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
  We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
  arXiv  Detail & Related papers  (2020-08-24T06:50:57Z)
• Learning Near Optimal Policies with Low Inherent Bellman Error [115.16037976819331]
  We study the exploration problem with approximate linear action-value functions in episodic reinforcement learning. We show that exploration is possible using only emphbatch assumptions with an algorithm that achieves the optimal statistical rate for the setting we consider.
  arXiv  Detail & Related papers  (2020-02-29T02:02:40Z)
• Locally Private Hypothesis Selection [96.06118559817057]
  We output a distribution from $mathcalQ$ whose total variation distance to $p$ is comparable to the best such distribution. We show that the constraint of local differential privacy incurs an exponential increase in cost. Our algorithms result in exponential improvements on the round complexity of previous methods.
  arXiv  Detail & Related papers  (2020-02-21T18:30:48Z)

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.