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.
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.
Abstract The violation of a Bell inequality implies the existence of nonlocality, making device-independent randomness certification possible. This paper derives a tight upper bound for the maximal quantum violation of Gisin’s elegant Bell inequality (EBI) for arbitrary two-qubit states, along with the constraints required to achieve this bound. This method provides the necessary and sufficient conditions for violating the EBI for several quantum states, including pure two-qubit states and the Werner states. The lower bound of certifiable global randomness is analyzed based on the tight upper bound of the EBI for pure two-qubit states, with a comparison to the Clauser-Horne-Shimony-Holt (CHSH) inequality. The relationship between the noise level and the lower bound of certifiable global randomness with respect to the Werner states is also explored, and the comparisons with both the CHSH inequality and the chained inequality are given. The results indicate that when the state approaches a maximally entangled state within specific quantified ranges, the EBI demonstrates advantages over both the CHSH inequality and the chained inequality, providing theoretical guidance for experimental device-independent quantum random number generation.
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.
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.
Device-independent quantum key distribution allows two users to set up shared cryptographic key without the need to trust the quantum devices used. Doing so requires nonlocal correlations between the users. However, in Farkas et al. [Phys. Rev. Lett. 127, 050503 (2021)PRLTAO0031-900710.1103/PhysRevLett.127.050503] it was shown that for known protocols nonlocality is not always sufficient, leading to the question of whether there is a fundamental lower bound on the minimum amount of nonlocality needed for any device-independent quantum key distribution implementation. Here, we show that no such bound exists, giving schemes that achieve key with correlations arbitrarily close to the local set. Furthermore, some of our constructions achieve the maximum of 1 bit of key per pair of entangled qubits. We achieve this by studying a family of Bell inequalities that constitute all self-tests of the maximally entangled state with a single linear Bell expression. Within this family there exist nonlocal correlations with the property that one pair of inputs yield outputs arbitrarily close to perfect key. Such correlations exist for a range of Clauser-Horne-Shimony-Holt values, including those arbitrarily close to the classical bound. Finally, we show the existence of quantum correlations that can generate both perfect key and perfect randomness simultaneously, while also displaying arbitrarily small Clauser-Horne-Shimony-Holt violation. This opens up the possibility of a new class of cryptographic protocol.
One of the distinguishing features of quantum theory is that its measurement outcomes are usually unpredictable or, equivalently, random. Moreover, this randomness is certifiable with minimal assumptions in the so-called device-independent (DI) paradigm, where a device's behavior does not need to be presupposed but can be verified through the statistics it produces. In this work, we explore various forms of randomness that are certifiable in this setting, where two users can perform two binary-outcome measurements on their shared entangled state. In this case, even though the Clauser-Horne-Shimony-Holt (CHSH) Bell-inequality violation is a pre-requisite for the generation of DI certifiable randomness, the CHSH value alone does not generally give a tight bound on the certifiable randomness. Here, we determine the certifiable randomness when zero-probability constraints are incorporated into the task of DI randomness expansion for the standard local and global randomness and the so-called "blind" randomness. Asymptotically, we observe consistent improvements in the amount of DI certifiable randomness (of all kinds) as we increase the number zero constraints for a wide range of given CHSH Bell violations. However, if we further optimize over the allowed CHSH values, then benefits of these additional constraints over the standard CHSH-based protocol are only found in the case of global and blind randomness. In contrast, in the regimes of finite data, these zero constraints only give a slight improvement in the local randomness rate when compared with all existing protocols.
One of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations stronger than possible in classical physics. In addition to their theoretical significance, non-local correlations have practical applications, such as device-independent randomness generation, providing private unpredictable numbers even when obtained using devices delivered by an untrusted vendor. Thus, determining the quantity of certifiable randomness that can be produced using a specific set of non-local correlations is of significant interest. First, we present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources. We use semi-definite programming to give lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy in a device-independent scenario. Our results demonstrate the first experiment that certifies nearly two bits of randomness from binary measurements of two parties [1], [2]. Apart from single-round certification, we provide an analysis of finite-key protocol for quantum randomness expansion using the Entropy Accumulation Theorem. Second, we present an efficient and practical method for certifying quantum randomness using generalized measurements. Indeed, we have derived a method for self-testing the presence of POVMs. We present the certification of more than one bit of min-entropy from a single POVM on one of the qubits of an entangled state using a variant of the elegant Bell inequality. We also obtain more than one bit of randomness in a prepare and measure scenario of a similar structure with a POVM on a single qubit [3]. We provide numerical simulations to demonstrate the effectiveness of our randomness certification and expansion.