Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2311.03681

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

Hui-Xian Meng, Yu Zhang, Xing-Yan Fan, Jie Zhou, Wei-Min Shang, Jing‐Ling Chen

Published Nov 7, 2023• 0 citations
arXivHTMLPDF

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ı}-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.

DOI
10.48550/arxiv.2311.03681

Related papers

The iteration formula of (n, 2, d) full-correlated multi-component Bell function and its applications

Hui-Xian Meng, Yu Zhang, Xing-Yan Fan +3 more

Abstract No matter for a scientific or technological reason, constructing Bell inequalities for multi-partite and high-dimensional systems is a significant task. The Mermin-Ardehali-Belinskiĭ-Klyshko (MABK) inequality is expressed in the form of iteration formula and correlation functions, and is the generalization of the Clauser-Horne-Shimony-Holt (CHSH) inequality to multi-partite cases. In the sense of detecting the nonlocality of the noisy maximally entangled states with the most white noises for the corresponding quantum system, the Collins-Gisin-Linden-Massar-Popescu (CGLMP) inequality, expressed in the joint probabilities form, is the high-dimensional analogue of the Clauser-Horne (CH) inequalities on joint probabilities. In the sense of detecting the nonlocality of the noisy Greenberger-Horne-Zeilinger(GHZ) states with the most white noises for the n-qudit system, it is a challenging task to construct the multi-partite analogue of the CGLMP inequality with iteration formula and correlation functions. In this paper, we generalize the multi-component correlation functions [Phys. Rev. A 71, 032 107 (2005)] for bipartite d-dimensional systems to n-partite d-dimensional ones, introduce the general full-correlated multi-component Bell function I n , d , and construct the corresponding Bell inequality. By this way, we can reproduce both the CGLMP inequality and the Bell inequality in [Phys. Rev. A 71, 032 107 (2005)] for the case n = 2, and the MABK inequality for the case d = 2. Inspired by the iteration formula form of the MABK inequality, we prove that for prime d the general Bell function I n , d can be reformulated by iterating two Bell functions I n − 1 , d . As applications, for prime d, confined to the unbiased symmetric (d × 2)-port beam splitters and the noisy n-qudit GHZ states, we recover the most robust Bell inequalities for small n and d, such as for the (3, 2, 3), (4, 2, 3), (5, 2, 3), and (3, 2, 5) Bell scenarios, with the iteration formula and the most robust Bell inequalities for the (2, 2, d) scenario. This implies that the iteration formula is an efficient way of constructing the multi-partite analogues of the CGLMP inequality with correlation functions. In addition, we also give some new Bell inequalities with the same robustness but inequivalent to the known ones.

Physica Scripta•Jul 25, 2024•0 citations

Generalized iterative formula for Bell inequalities

Xing-Yan Fan, Zhen‐Peng Xu, Jia-Le Miao +7 more

Bell inequality is a vital tool to detect the nonlocal correlations, but the construction of it for multipartite systems is still a complicated problem. In this work, 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. Our iterative formulas recover the well-known Mermin-Ardehali-Belinsk\ifmmode \breve{\imath}\else \u{\i}\fi{}-Klyshko (MABK) and other families in the literature as special cases. Moreover, a family of ``dual-use'' Bell inequalities is proposed, in the sense that for the generalized Greenberger-Horne-Zeilinger states these inequalities lead to the same quantum violation as the MABK family and, at the same time, the inequalities are able to detect the nonlocality in the entire entangled region. Furthermore, we present a generalization of the I3322 inequality to any $n$-partite case which is still tight, and of the 46 \ifmmode \acute{S}\else \'{S}\fi{}liwa's inequalities to the four-partite tight ones, by applying our iteration method to each inequality and its equivalence class.

arXiv:2109.05521•Physical Review A•Dec 6, 2023•1 citation

Tight correlation-function Bell inequality for multipartite d -dimensional systems

Jing‐Ling Chen, Dong-Ling Deng

We generalize the correlation functions of the Clauser-Horne-Shimony-Holt (CHSH) inequality to multipartite $d$-dimensional systems. All the Bell inequalities based on this generalization take the same simple form as the CHSH inequality. For small systems, numerical results show that the new inequalities are tight and we believe this is also valid for higher-dimensional systems. Moreover, the new inequalities are relevant to the previous ones and, for bipartite systems, our inequality is equivalent to the Collins-Gisin-Linden-Masser-Popescu inequality.

arXiv:0809.1713•Physical Review A•Jan 23, 2009•11 citations

Expanding bipartite Bell inequalities for maximum multi-partite randomness

Lewis Wooltorton, Peter J. Brown, Roger Colbeck

Nonlocal tests on multi-partite quantum correlations form the basis of protocols that certify randomness in a device-independent (DI) way. Such correlations admit a rich structure, making the task of choosing an appropriate test difficult. For example, extremal Bell inequalities are tight witnesses of nonlocality, but achieving their maximum violation places constraints on the underlying quantum system, which can reduce the rate of randomness generation. As a result there is often a trade-off between maximum randomness and the amount of violation of a given Bell inequality. Here, we explore this trade-off for more than two parties. More precisely, we study the maximum amount of randomness that can be certified by correlations with a particular violation of the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality. For any even number of parties, we find that maximum randomness cannot occur beyond a threshold quantum violation, which increases with the number of parties, and we give a conjectured form of the maximum randomness in terms of the MABK value. We also show that maximum randomness can be obtained for any MABK violation for odd numbers of parties. To obtain our results, we derive new families of Bell inequalities certifying maximum randomness from a technique for randomness certification, which we call "expanding Bell inequalities''. Our technique allows a bipartite Bell expression to be used as a seed, and transformed into a multi-partite Bell inequality tailored for randomness certification, showing how intuition learned in the bipartite case can find use in more complex scenarios.

arXiv:2308.07030•Quantum•Dec 5, 2025•1 citation

Multipartite Bell-type inequalities for arbitrary numbers of settings and outcomes per site

Elena R. Loubenets

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.

arXiv:0804.4046•Journal of Physics A Mathematical and Theoretical•Oct 7, 2008•22 citations

Axiomatic approach for the functional bound of generic Bell's inequality

Gwangil Bae, Wonmin Son

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.

arXiv:1407.1030•Jul 3, 2014•1 citation
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.
Abstract No matter for a scientific or technological reason, constructing Bell inequalities for multi-partite and high-dimensional systems is a significant task. The Mermin-Ardehali-Belinskiĭ-Klyshko (MABK) inequality is expressed in the form of iteration formula and correlation functions, and is the generalization of the Clauser-Horne-Shimony-Holt (CHSH) inequality to multi-partite cases. In the sense of detecting the nonlocality of the noisy maximally entangled states with the most white noises for the corresponding quantum system, the Collins-Gisin-Linden-Massar-Popescu (CGLMP) inequality, expressed in the joint probabilities form, is the high-dimensional analogue of the Clauser-Horne (CH) inequalities on joint probabilities. In the sense of detecting the nonlocality of the noisy Greenberger-Horne-Zeilinger(GHZ) states with the most white noises for the n-qudit system, it is a challenging task to construct the multi-partite analogue of the CGLMP inequality with iteration formula and correlation functions. In this paper, we generalize the multi-component correlation functions [Phys. Rev. A 71, 032 107 (2005)] for bipartite d-dimensional systems to n-partite d-dimensional ones, introduce the general full-correlated multi-component Bell function I n , d , and construct the corresponding Bell inequality. By this way, we can reproduce both the CGLMP inequality and the Bell inequality in [Phys. Rev. A 71, 032 107 (2005)] for the case n = 2, and the MABK inequality for the case d = 2. Inspired by the iteration formula form of the MABK inequality, we prove that for prime d the general Bell function I n , d can be reformulated by iterating two Bell functions I n − 1 , d . As applications, for prime d, confined to the unbiased symmetric (d × 2)-port beam splitters and the noisy n-qudit GHZ states, we recover the most robust Bell inequalities for small n and d, such as for the (3, 2, 3), (4, 2, 3), (5, 2, 3), and (3, 2, 5) Bell scenarios, with the iteration formula and the most robust Bell inequalities for the (2, 2, d) scenario. This implies that the iteration formula is an efficient way of constructing the multi-partite analogues of the CGLMP inequality with correlation functions. In addition, we also give some new Bell inequalities with the same robustness but inequivalent to the known ones.
Bell inequality is a vital tool to detect the nonlocal correlations, but the construction of it for multipartite systems is still a complicated problem. In this work, inspired via a decomposition of (n+1)(n+1)(n+1)-partite Bell inequalities into nnn-partite ones, we present a generalized iterative formula to construct nontrivial (n+1)(n+1)(n+1)-partite ones from the nnn-partite ones. Our iterative formulas recover the well-known Mermin-Ardehali-Belinsk\ifmmode \breve{\imath}\else \u{\i}\fi{}-Klyshko (MABK) and other families in the literature as special cases. Moreover, a family of ``dual-use'' Bell inequalities is proposed, in the sense that for the generalized Greenberger-Horne-Zeilinger states these inequalities lead to the same quantum violation as the MABK family and, at the same time, the inequalities are able to detect the nonlocality in the entire entangled region. Furthermore, we present a generalization of the I3322 inequality to any nnn-partite case which is still tight, and of the 46 \ifmmode \acute{S}\else \'{S}\fi{}liwa's inequalities to the four-partite tight ones, by applying our iteration method to each inequality and its equivalence class.
We generalize the correlation functions of the Clauser-Horne-Shimony-Holt (CHSH) inequality to multipartite ddd-dimensional systems. All the Bell inequalities based on this generalization take the same simple form as the CHSH inequality. For small systems, numerical results show that the new inequalities are tight and we believe this is also valid for higher-dimensional systems. Moreover, the new inequalities are relevant to the previous ones and, for bipartite systems, our inequality is equivalent to the Collins-Gisin-Linden-Masser-Popescu inequality.
Nonlocal tests on multi-partite quantum correlations form the basis of protocols that certify randomness in a device-independent (DI) way. Such correlations admit a rich structure, making the task of choosing an appropriate test difficult. For example, extremal Bell inequalities are tight witnesses of nonlocality, but achieving their maximum violation places constraints on the underlying quantum system, which can reduce the rate of randomness generation. As a result there is often a trade-off between maximum randomness and the amount of violation of a given Bell inequality. Here, we explore this trade-off for more than two parties. More precisely, we study the maximum amount of randomness that can be certified by correlations with a particular violation of the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality. For any even number of parties, we find that maximum randomness cannot occur beyond a threshold quantum violation, which increases with the number of parties, and we give a conjectured form of the maximum randomness in terms of the MABK value. We also show that maximum randomness can be obtained for any MABK violation for odd numbers of parties. To obtain our results, we derive new families of Bell inequalities certifying maximum randomness from a technique for randomness certification, which we call "expanding Bell inequalities''. Our technique allows a bipartite Bell expression to be used as a seed, and transformed into a multi-partite Bell inequality tailored for randomness certification, showing how intuition learned in the bipartite case can find use in more complex scenarios.
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.
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.