We propose a formalism to derive the maximal bound of generalized Bell type inequalities and shows that the formalism can be applied to various form of Bell functions. The generic Bell function is defined to generate the combinations of all the possible correlations whose local realistic bound can be obtained from the series of the constraint equations. The application of the constraints converts the optimization problem into the counting problems whose complexity is dramatically reduced. It is also shown that generic Bell function can be used to generate many other known Bell type functions such as Mermin, Ardehali, Svetlichny functions for multipartite two-dimensional class.
We propose a formalism to derive the maximal bound of generalized Bell type inequalities and shows that the formalism can be applied to various form of Bell functions. The generic Bell function is defined to generate the combinations of all the possible correlations whose local realistic bound can be obtained from the series of the constraint equations. The application of the constraints converts the optimization problem into the counting problems whose complexity is dramatically reduced. It is also shown that generic Bell function can be used to generate many other known Bell type functions such as Mermin, Ardehali, Svetlichny functions for multipartite two-dimensional class.
We introduce a single general representation incorporating in a unique manner all Bell-type inequalities for a multipartite correlation scenario with an arbitrary number of settings and any spectral type of outcomes at each site. Specifying this general representation for correlation functions, we prove that the form of any correlation Bell-type inequality does not depend on spectral types of outcomes, in particular, on their numbers at different sites, and is determined only by extremal values of outcomes at each site. We also specify the general form of bounds in Bell-type inequalities on joint probabilities. Our approach to the derivation of Bell-type inequalities is universal, concise and can be applied to a multipartite correlation experiment with outcomes of any spectral type, discrete or continuous. We, in particular, prove that, for an N -partite quantum state, possibly, infinite dimensional, admitting the -setting LHV description, the Mermin–Klyshko inequality holds for any two bounded quantum observables per site, not necessarily dichotomic.
Bell-inequality violation is one of the most widely known manifestations of entanglement in quantum mechanics; indicating that experiments on physically separated quantum mechanical systems cannot be given a local realistic description. However, despite the importance of Bell inequalities, it is not known in general how to determine whether a given entangled state will violate a Bell inequality. This is because one can choose to make many different measurements on a quantum system to test any given Bell inequality and the optimization over measurements is a high-dimensional variational problem. In order to better understand this problem we present algorithms that provide, for a given quantum state and Bell inequality, both a lower bound and an upper bound on the maximal violation of the inequality. In many cases these bounds determine measurements that would demonstrate violation of the Bell inequality or provide a bound that rules out the possibility of a violation. Both bounds apply techniques from convex optimization and the methodology for creating upper bounds allows them to be systematically improved. Examples are given to illustrate how these algorithms can be used to conclude definitively if some quantum states violate a given Bell inequality.
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ı}-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.
Despite their importance, there is an ongoing challenge characterizing multipartite quantum correlations. The Seevinck-Svetlichny (SS) and Mermin-Klyshko (MK) inequalities present constraints on correlations in multipartite systems, a violation of which allows to classify the correlations by using the nonseparability 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 SS 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, i.e., lie beneath the previously found constants, thus better characterizing the set of allowed quantum correlations. We interpret the results as complementarity relations between multipartite and local correlations, as well as multipartite and bipartite correlations.
We present a constraint-based axiomatization of quantum correla- tions that derives Bell statistics without invoking Hilbert space, wave functions, or causal mechanisms. Starting from five physically moti- vated axioms—rotational invariance, perfect anti-correlation, uniform marginals (no-signaling), smoothness, and extremality—we prove that the singlet correlation function E(ˆ a,ˆˆb) =−ˆa·b is uniquely deter- mined. The proof proceeds through functional equation analysis: the extremality axiom implies angle additivity, reducing the problem to Cauchy’s equation with boundary conditions. We derive the Tsirelson bound |S|≤2√2 directly from this correlation function without op- erator algebras, and show that CHSH violation follows as a theorem. The no-signaling condition emerges as a structural property of the con- straint, ensuring compatibility with relativistic causality. We extend the framework to tripartite systems, deriving GHZ correlations from analogous axioms and proving maximal Mermin inequality violation. The constraint interpretation dissolves the tension between entangle- ment and causality: correlations are neither caused nor explained by hidden variables—they are specified by the constraint structure itself. This framework recovers all quantum predictions while eliminating causation from the foundational ontology.
Bell inequalities are important tools in contrasting classical and quantum behaviors. To date, most Bell inequalities are linear combinations of statistical correlations between remote parties. Nevertheless, finding the classical and quantum mechanical (Tsirelson) bounds for a given Bell inequality in a general scenario is a difficult task which rarely leads to closed-form solutions. Here we introduce a class of Bell inequalities based on products of correlators that alleviate these issues. Each such Bell inequality is associated with a unique coordination game. In the simplest case, Alice and Bob, each having two random variables, attempt to maximize the area of a rectangle and the rectangle's area is represented by a certain parameter. This parameter, which is a function of the correlations between their random variables, is shown to be a Bell parameter, i.e., the achievable bound using only classical correlations is strictly smaller than the achievable bound using nonlocal quantum correlations We continue by generalizing to the case in which Alice and Bob, each having now n random variables, wish to maximize a certain volume in n-dimensional space. We term this parameter a multiplicative Bell parameter and prove its Tsirelson bound. Finally, we investigate the case of local hidden variables and show that for any deterministic strategy of one of the players, the Bell parameter is a harmonic function whose maximum approaches the Tsirelson bound as the number of measurement devices increases. Some theoretical and experimental implications of these results are discussed.