Refined Tsirelson Bounds on Multipartite Bell Inequalities
- URL: http://arxiv.org/abs/2406.16202v1
- Date: Sun, 23 Jun 2024 19:44:45 GMT
- Title: Refined Tsirelson Bounds on Multipartite Bell Inequalities
- Authors: Rain Lenny, Dana Ben Porath, Eliahu Cohen,
- Abstract summary: We present refined Tsirelson (quantum) bounds on the Svetlichny and Mermin-Klyshko inequalities.
We analyze concrete examples in which our bounds are strictly tighter than the known bounds.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Despite their importance, there is an on-going challenge characterizing multipartite quantum correlations. The Svetlichny and Mermin-Klyshko (MK) inequalities present constraints on correlations in multipartite systems, a violation of which allows to classify the correlations by using the non-separability property. In this work we present refined Tsirelson (quantum) bounds on these inequalities, derived from inequalities stemming from a fundamental constraint, tightly akin to quantum uncertainty. Unlike the original, known inequalities, our bounds do not consist of a single constant point but rather depend on correlations in specific subsystems (being local correlations for our bounds on the Svetlichny operators and bipartite correlations for our bounds on the MK operators). We analyze concrete examples in which our bounds are strictly tighter than the known bounds.
Related papers
- Relationship between average correlation and quantum steering for arbitrary two-qubit states [0.3749861135832073]
We establish the relationship between the average correlation and the violation of the three-setting linear steering inequality for two-qubit systems.
For a given class of states, the hierarchy of nonclassicality-steering-Bell nonlocality is demonstrated.
arXiv Detail & Related papers (2024-10-15T03:05:43Z) - Operator representation of spatiotemporal quantum correlations [0.0]
We prove that there does not exist an operator representation for general quantum correlations across space and time.
In the case of qutrit systems, we use our results to illustrate an intriguing connection between light-touch observables and symmetric, informationally complete, positive operator-valued measures.
arXiv Detail & Related papers (2024-05-27T18:00:02Z) - Tsirelson bounds for quantum correlations with indefinite causal order [4.162019309587634]
We provide a general method for bounding the violation of arbitrary causal inequalities.
We prove that the maximum violation is generally smaller than the algebraic maximum.
Surprisingly, we find that the algebraic maximum of arbitrary causal inequalities can be achieved by a new type of processes.
arXiv Detail & Related papers (2024-03-05T08:07:10Z) - 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) - Chained Generalisation Bounds [26.043342234937747]
We derive upper bounds for the expected generalisation error of supervised learning algorithms by means of the chaining technique.
We establish a duality between generalisation bounds based on the regularity of the loss function, and their chained counterparts.
arXiv Detail & Related papers (2022-03-02T09:34:36Z) - 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) - Estimating means of bounded random variables by betting [39.98103047898974]
This paper derives confidence intervals (CI) and time-uniform confidence sequences (CS) for the classical problem of estimating an unknown mean from bounded observations.
We present a general approach for deriving concentration bounds, that can be seen as a generalization and improvement of the celebrated Chernoff method.
We show how to extend these ideas to sampling without replacement, another heavily studied problem.
arXiv Detail & Related papers (2020-10-19T17:22:03Z) - Relative Deviation Margin Bounds [55.22251993239944]
We give two types of learning bounds, both distribution-dependent and valid for general families, in terms of the Rademacher complexity.
We derive distribution-dependent generalization bounds for unbounded loss functions under the assumption of a finite moment.
arXiv Detail & Related papers (2020-06-26T12:37:17Z) - Sample Complexity of Uniform Convergence for Multicalibration [43.10452387619829]
We address the multicalibration error and decouple it from the prediction error.
Our work gives sample complexity bounds for uniform convergence guarantees of multicalibration error.
arXiv Detail & Related papers (2020-05-04T18:01:38Z) - Unbounded Bell violations for quantum genuine multipartite non-locality [0.5156484100374058]
Bell inequalities by measurements on quantum states give rise to the phenomenon of quantum non-locality.
We show that while in the so-called correlation scenario the relative violation of bilocal Bell inequalities by quantum resources is bounded, it does not grow arbitrarily with the number of inputs.
We identify Bell functionals that take the form of non-local games for which the ratio of the quantum and bilocal values grows unboundedly as a function of the number of inputs and outputs.
arXiv Detail & Related papers (2020-02-28T09:28:27Z)
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.