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:1804.09733 · Quantum

Randomness versus nonlocality in the Mermin-Bell experiment with three parties

Erik Woodhead, Boris Bourdoncle, Antonio Acín

Published Aug 17, 2018• 31 citations
arXivHTMLPDF

Abstract

The detection of nonlocal correlations in a Bell experiment implies almost by definition some intrinsic randomness in the measurement outcomes. For given correlations, or for a given Bell violation, the amount of randomness predicted by quantum physics, quantified by the guessing probability, can generally be bounded numerically. However, currently only a few exact analytic solutions are known for violations of the bipartite Clauser-Horne-Shimony-Holt Bell inequality. Here, we study the randomness in a Bell experiment where three parties test the tripartite Mermin-Bell inequality. We give tight upper bounds on the guessing probabilities associated with one and two of the parties' measurement outcomes as a function of the Mermin inequality violation. Finally, we discuss the possibility of device-independent secret sharing based on the Mermin inequality and argue that the idea seems unlikely to work.

DOI
10.22331/q-2018-08-17-82

Related papers

Certifying optimal device-independent quantum randomness in quantum networks

Shuai Zhao, Rong Wang, Qi Zhao

Bell nonlocality provides a device-independent (DI) way to certify quantum randomness, based on which true random numbers can be extracted from the observed correlations without detail characterizations on devices for quantum state preparation and measurement. However, the efficiency of current strategies for DI randomness certification is still heavily constrained when it comes to non-maximal Bell values, especially for multiple parties. Here, we present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ (Greenberger-Horne-Zeilinger) states, which are inspired from the stabilizer group of the GHZ state. Due to the simple representation of stabilizer group for GHZ states, this family of Bell inequalities is of simple structure and can be easily expanded to more parties. Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved. Meanwhile, the general analytical upper bound for the Holevo quantity is presented, and achieves better performance compared with the MABK (Mermin-Ardehali-Belinskii-Klyshko) inequality, Parity-CHSH (Clauser-Horne-Shimony-Holt) inequality and Holz inequality at $N=3$, which is of particular interests for experimental researches on DI quantum cryptography in quantum networks.

quant-pharXiv:2601.18534•Jan 27, 2026•3 citations

Randomness versus Nonlocality and Entanglement

Antonio Acín, Serge Massar, Stefano Pironio

The outcomes obtained in Bell tests involving two-outcome measurements on two subsystems can, in principle, generate up to 2 bits of randomness. However, the maximal violation of the Clauser-Horne-Shimony-Holt inequality guarantees the generation of only 1.23 bits of randomness. We prove here that quantum correlations with arbitrarily little nonlocality and states with arbitrarily little entanglement can be used to certify that close to the maximum of 2 bits of randomness are produced. Our results show that nonlocality, entanglement, and randomness are inequivalent quantities. They also imply that device-independent quantum key distribution with an optimal key generation rate is possible by using almost-local correlations and that device-independent randomness generation with an optimal rate is possible with almost-local correlations and with almost-unentangled states.

arXiv:1107.2754•Physical Review Letters•Mar 9, 2012•332 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•6 citations

Tight Analytic Bound on the Trade-Off between Device-Independent Randomness and Nonlocality

Lewis Wooltorton, Peter J. Brown, Roger Colbeck

Two parties sharing entangled quantum systems can generate correlations that cannot be produced using only shared classical resources. These nonlocal correlations are a fundamental feature of quantum theory but also have practical applications. For instance, they can be used for device-independent random number generation, whose security is certified independently of the operations performed inside the devices. The amount of certifiable randomness that can be generated from some given nonlocal correlations is a key quantity of interest. Here, we derive tight analytic bounds on the maximum certifiable randomness as a function of the nonlocality as expressed using the Clauser-Horne-Shimony-Holt (CHSH) value. We show that for every CHSH value greater than the local value (2) and up to 3sqrt[3]/2≈2.598 there exist quantum correlations with that CHSH value that certify a maximal two bits of global randomness. Beyond this CHSH value the maximum certifiable randomness drops. We give a second family of Bell inequalities for CHSH values above 3sqrt[3]/2, and show that they certify the maximum possible randomness for the given CHSH value. Our work hence provides an achievable upper bound on the amount of randomness that can be certified for any CHSH value. We illustrate the robustness of our results, and how they could be used to improve randomness generation rates in practice, using a Werner state noise model.

arXiv:2205.00124•Physical Review Letters•Oct 5, 2022•38 citations

Boosting device-independent cryptography with tripartite nonlocality

Federico Grasselli, Gláucia Murta, Hermann Kampermann +1 more

Device-independent (DI) protocols, such as DI conference key agreement (DICKA) and DI randomness expansion (DIRE), certify private randomness by observing nonlocal correlations when two or more parties test a Bell inequality. While most DI protocols are restricted to bipartite Bell tests, harnessing multipartite nonlocal correlations may lead to better performance. Here, we consider tripartite DICKA and DIRE protocols based on testing multipartite Bell inequalities, specifically: the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality, and the Holz and the Parity-CHSH inequalities introduced in the context of DICKA protocols. We evaluate the asymptotic performance of the DICKA (DIRE) protocols in terms of their conference key rate (net randomness generation rate), by deriving lower bounds on the conditional von Neumann entropy of one party's outcome and two parties' outcomes. For the Holz inequality, we prove a tight analytical lower bound on the one-outcome entropy and conjecture a tight lower bound on the two-outcome entropy. We additionally re-derive the analytical one-outcome entropy bound for the MABK inequality with a much simpler method and obtain a numerical lower bound on the two-outcome entropy for the Parity-CHSH inequality. Our simulations show that DICKA and DIRE protocols employing tripartite Bell inequalities can significantly outperform their bipartite counterparts. Moreover, we establish that genuine multipartite entanglement is not a precondition for multipartite DIRE while its necessity for DICKA remains an open question.

arXiv:2209.12828•Quantum•Apr 13, 2023•17 citations

Bell nonlocality and device-independent quantum information

Sachin .

Bell nonlocality is the experimentally testable incompatibility between quantum correlations and explanations based on local hidden variables. Its significance now extends beyond the foundations of quantum mechanics: a Bell-inequality violation can certify entanglement, randomness, measurement incompatibility, and cryptographic security without requiring a detailed model of the devices producing the observed data. This article develops the mathematical structure of Bell experiments and explains its role in device-independent quantum information. Conditional probability distributions are classified into local, quantum, and no-signalling sets; the Clauser-Horne-Shimony-Holt inequality is derived, and its classical, quantum, and algebraic limits are distinguished. Tsirelson’s bound is obtained from the CHSH operator, while Popescu-Rohrlich correlations demonstrate that no-signalling alone does not identify the quantum set. The relation between entanglement and nonlocality is examined through local entangled states, hidden nonlocality, and activation. Nonlocal games, semidefinite relaxations, self-testing, certified randomness, and device-independent quantum key distribution are treated as operational consequences of Bell violation. Particular attention is given to entropy accumulation, finite-data security, loophole-free experiments, and the limitations of device independence. Bell nonlocality emerges as both a foundational separation between classical and quantum causal models and a quantitative resource for cryptographic and informational tasks.

International Journal of Physics and Mathematics•Jan 1, 2026•0 citations
The detection of nonlocal correlations in a Bell experiment implies almost by definition some intrinsic randomness in the measurement outcomes. For given correlations, or for a given Bell violation, the amount of randomness predicted by quantum physics, quantified by the guessing probability, can generally be bounded numerically. However, currently only a few exact analytic solutions are known for violations of the bipartite Clauser-Horne-Shimony-Holt Bell inequality. Here, we study the randomness in a Bell experiment where three parties test the tripartite Mermin-Bell inequality. We give tight upper bounds on the guessing probabilities associated with one and two of the parties' measurement outcomes as a function of the Mermin inequality violation. Finally, we discuss the possibility of device-independent secret sharing based on the Mermin inequality and argue that the idea seems unlikely to work.
Bell nonlocality provides a device-independent (DI) way to certify quantum randomness, based on which true random numbers can be extracted from the observed correlations without detail characterizations on devices for quantum state preparation and measurement. However, the efficiency of current strategies for DI randomness certification is still heavily constrained when it comes to non-maximal Bell values, especially for multiple parties. Here, we present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ (Greenberger-Horne-Zeilinger) states, which are inspired from the stabilizer group of the GHZ state. Due to the simple representation of stabilizer group for GHZ states, this family of Bell inequalities is of simple structure and can be easily expanded to more parties. Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved. Meanwhile, the general analytical upper bound for the Holevo quantity is presented, and achieves better performance compared with the MABK (Mermin-Ardehali-Belinskii-Klyshko) inequality, Parity-CHSH (Clauser-Horne-Shimony-Holt) inequality and Holz inequality at N=3N=3N=3, which is of particular interests for experimental researches on DI quantum cryptography in quantum networks.
The outcomes obtained in Bell tests involving two-outcome measurements on two subsystems can, in principle, generate up to 2 bits of randomness. However, the maximal violation of the Clauser-Horne-Shimony-Holt inequality guarantees the generation of only 1.23 bits of randomness. We prove here that quantum correlations with arbitrarily little nonlocality and states with arbitrarily little entanglement can be used to certify that close to the maximum of 2 bits of randomness are produced. Our results show that nonlocality, entanglement, and randomness are inequivalent quantities. They also imply that device-independent quantum key distribution with an optimal key generation rate is possible by using almost-local correlations and that device-independent randomness generation with an optimal rate is possible with almost-local correlations and with almost-unentangled states.
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.
Two parties sharing entangled quantum systems can generate correlations that cannot be produced using only shared classical resources. These nonlocal correlations are a fundamental feature of quantum theory but also have practical applications. For instance, they can be used for device-independent random number generation, whose security is certified independently of the operations performed inside the devices. The amount of certifiable randomness that can be generated from some given nonlocal correlations is a key quantity of interest. Here, we derive tight analytic bounds on the maximum certifiable randomness as a function of the nonlocality as expressed using the Clauser-Horne-Shimony-Holt (CHSH) value. We show that for every CHSH value greater than the local value (2) and up to 3sqrt[3]/2≈2.598 there exist quantum correlations with that CHSH value that certify a maximal two bits of global randomness. Beyond this CHSH value the maximum certifiable randomness drops. We give a second family of Bell inequalities for CHSH values above 3sqrt[3]/2, and show that they certify the maximum possible randomness for the given CHSH value. Our work hence provides an achievable upper bound on the amount of randomness that can be certified for any CHSH value. We illustrate the robustness of our results, and how they could be used to improve randomness generation rates in practice, using a Werner state noise model.
Device-independent (DI) protocols, such as DI conference key agreement (DICKA) and DI randomness expansion (DIRE), certify private randomness by observing nonlocal correlations when two or more parties test a Bell inequality. While most DI protocols are restricted to bipartite Bell tests, harnessing multipartite nonlocal correlations may lead to better performance. Here, we consider tripartite DICKA and DIRE protocols based on testing multipartite Bell inequalities, specifically: the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality, and the Holz and the Parity-CHSH inequalities introduced in the context of DICKA protocols. We evaluate the asymptotic performance of the DICKA (DIRE) protocols in terms of their conference key rate (net randomness generation rate), by deriving lower bounds on the conditional von Neumann entropy of one party's outcome and two parties' outcomes. For the Holz inequality, we prove a tight analytical lower bound on the one-outcome entropy and conjecture a tight lower bound on the two-outcome entropy. We additionally re-derive the analytical one-outcome entropy bound for the MABK inequality with a much simpler method and obtain a numerical lower bound on the two-outcome entropy for the Parity-CHSH inequality. Our simulations show that DICKA and DIRE protocols employing tripartite Bell inequalities can significantly outperform their bipartite counterparts. Moreover, we establish that genuine multipartite entanglement is not a precondition for multipartite DIRE while its necessity for DICKA remains an open question.
Bell nonlocality is the experimentally testable incompatibility between quantum correlations and explanations based on local hidden variables. Its significance now extends beyond the foundations of quantum mechanics: a Bell-inequality violation can certify entanglement, randomness, measurement incompatibility, and cryptographic security without requiring a detailed model of the devices producing the observed data. This article develops the mathematical structure of Bell experiments and explains its role in device-independent quantum information. Conditional probability distributions are classified into local, quantum, and no-signalling sets; the Clauser-Horne-Shimony-Holt inequality is derived, and its classical, quantum, and algebraic limits are distinguished. Tsirelson’s bound is obtained from the CHSH operator, while Popescu-Rohrlich correlations demonstrate that no-signalling alone does not identify the quantum set. The relation between entanglement and nonlocality is examined through local entangled states, hidden nonlocality, and activation. Nonlocal games, semidefinite relaxations, self-testing, certified randomness, and device-independent quantum key distribution are treated as operational consequences of Bell violation. Particular attention is given to entropy accumulation, finite-data security, loophole-free experiments, and the limitations of device independence. Bell nonlocality emerges as both a foundational separation between classical and quantum causal models and a quantitative resource for cryptographic and informational tasks.