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:2309.09650 · Physical Review Letters

Device-Independent Quantum Key Distribution with Arbitrarily Small Nonlocality

Lewis Wooltorton, Peter J. Brown, Roger Colbeck

Published May 22, 2024• 35 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.132.210802

Related papers

Robust Quantum Key Distribution Arbitrarily Close to Local Correlations

Hari Krishnan SV, Andreas Winter

Recently, Wooltorton et al. [Phys. Rev. Lett. 132, 210802 (2024)] and Farkas [Phys. Rev. Lett. 132, 210803 (2024)] have exhibited the mismatch between Bell inequality violations and their cryptographic application in device-independent quantum key distribution, by showing that arbitrarily close to the set of local behaviours there exist quantum correlations guaranteeing a constant rate of secret key. While these results require correlations attaining the maximum quantum value of a suitable Bell observable (aka the Tsirelson bound) and rely on a kind of ideal self-testing of a maximally entangled state and associated Bell measurement, here we show that the effect is robust: for every one of the Bell inequalities considered by Wooltorton \emph{et al.}, a constant rate of secret key ensues if the observed Bell violation is sufficiently close to the respective Tsirelson bound. For these and also the Bell inequalities of Farkas, we furthermore present numerical results based on semidefinite relaxations of the minimum min-entropy consistent with a certain Bell violation, which demonstrate that small but nonzero key rates can be guaranteed (in principle) by practical and efficient means.

quant-pharXiv:2608.22603•Aug 25, 2026•0 citations

Unbounded Device-Independent Quantum Key Rates from Arbitrarily Small Nonlocality

Máté Farkas

Device-independent quantum key distribution allows for proving the security of a shared cryptographic key between two distant parties with potentially untrusted devices. The security proof is based on the measurement outcome statistics (correlation) of a Bell experiment, and security is guaranteed by the laws of quantum theory. While it is known that the observed correlation must be Bell nonlocal in order to prove security, recent results show that Bell nonlocality is in general not sufficient for standard device-independent quantum key distribution. In this work, we show that conversely, there is no lower bound on the amount of nonlocality that is sufficient for device-independent quantum key distribution. Even more so, we show that from certain correlations that exhibit arbitrarily small nonlocality, one can still extract unbounded device-independent key rates. Therefore, a quantitative relation between device-independent key rates and Bell nonlocality cannot be drawn in general. Our main technique comprises a rigorous connection between self-testing and device-independent quantum key distribution, applied to a recently discovered family of Bell inequalities with arbitrarily many measurement outcomes.

arXiv:2310.08635•Physical Review Letters•May 22, 2024•18 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

Bell Nonlocality Is Not Sufficient for the Security of Standard Device-Independent Quantum Key Distribution Protocols

Máté Farkas, Maria Balanzó-Juandó, Karol Łukanowski +2 more

Device-independent quantum key distribution is a secure quantum cryptographic paradigm that allows two honest users to establish a secret key, while putting minimal trust in their devices. Most of the existing protocols have the following structure: first, a bipartite nonlocal quantum state is distributed between the honest users, who perform local projective measurements to establish nonlocal correlations. Then, they announce the implemented measurements and extract a secure key by postprocessing their measurement outcomes. We show that no protocol of this form allows for establishing a secret key when implemented on any correlation obtained by measuring local projective measurements on certain entangled nonlocal states, namely, on a range of entangled two-qubit Werner states. To prove this result, we introduce a technique for upper bounding the asymptotic key rate of device-independent quantum key distribution protocols, based on a simple eavesdropping attack. Our results imply that either different reconciliation techniques are needed for device-independent quantum key distribution in the large-noise regime, or Bell nonlocality is not sufficient for this task.

arXiv:2103.02639•Physical Review Letters•Jul 29, 2021•48 citations

Device-independent quantum key distribution with asymmetric CHSH inequalities

Erik Woodhead, Antonio Acín, Stefano Pironio

The simplest device-independent quantum key distribution protocol is based on the Clauser-Horne-Shimony-Holt (CHSH) Bell inequality and allows two users, Alice and Bob, to generate a secret key if they observe sufficiently strong correlations. There is, however, a mismatch between the protocol, in which only one of Alice's measurements is used to generate the key, and the CHSH expression, which is symmetric with respect to Alice's two measurements. We therefore investigate the impact of using an extended family of Bell expressions where we give different weights to Alice's measurements. Using this family of asymmetric Bell expressions improves the robustness of the key distribution protocol for certain experimentally-relevant correlations. As an example, the tolerable error rate improves from 7.15% to about 7.42% for the depolarising channel. Adding random noise to Alice's key before the postprocessing pushes the threshold further to more than 8.34%. The main technical result of our work is a tight bound on the von Neumann entropy of one of Alice's measurement outcomes conditioned on a quantum eavesdropper for the family of asymmetric CHSH expressions we consider and allowing for an arbitrary amount of noise preprocessing.

arXiv:2007.16146•Quantum•Apr 26, 2021•66 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
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.
Recently, Wooltorton et al. [Phys. Rev. Lett. 132, 210802 (2024)] and Farkas [Phys. Rev. Lett. 132, 210803 (2024)] have exhibited the mismatch between Bell inequality violations and their cryptographic application in device-independent quantum key distribution, by showing that arbitrarily close to the set of local behaviours there exist quantum correlations guaranteeing a constant rate of secret key. While these results require correlations attaining the maximum quantum value of a suitable Bell observable (aka the Tsirelson bound) and rely on a kind of ideal self-testing of a maximally entangled state and associated Bell measurement, here we show that the effect is robust: for every one of the Bell inequalities considered by Wooltorton \emph{et al.}, a constant rate of secret key ensues if the observed Bell violation is sufficiently close to the respective Tsirelson bound. For these and also the Bell inequalities of Farkas, we furthermore present numerical results based on semidefinite relaxations of the minimum min-entropy consistent with a certain Bell violation, which demonstrate that small but nonzero key rates can be guaranteed (in principle) by practical and efficient means.
Device-independent quantum key distribution allows for proving the security of a shared cryptographic key between two distant parties with potentially untrusted devices. The security proof is based on the measurement outcome statistics (correlation) of a Bell experiment, and security is guaranteed by the laws of quantum theory. While it is known that the observed correlation must be Bell nonlocal in order to prove security, recent results show that Bell nonlocality is in general not sufficient for standard device-independent quantum key distribution. In this work, we show that conversely, there is no lower bound on the amount of nonlocality that is sufficient for device-independent quantum key distribution. Even more so, we show that from certain correlations that exhibit arbitrarily small nonlocality, one can still extract unbounded device-independent key rates. Therefore, a quantitative relation between device-independent key rates and Bell nonlocality cannot be drawn in general. Our main technique comprises a rigorous connection between self-testing and device-independent quantum key distribution, applied to a recently discovered family of Bell inequalities with arbitrarily many measurement outcomes.
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.
Device-independent quantum key distribution is a secure quantum cryptographic paradigm that allows two honest users to establish a secret key, while putting minimal trust in their devices. Most of the existing protocols have the following structure: first, a bipartite nonlocal quantum state is distributed between the honest users, who perform local projective measurements to establish nonlocal correlations. Then, they announce the implemented measurements and extract a secure key by postprocessing their measurement outcomes. We show that no protocol of this form allows for establishing a secret key when implemented on any correlation obtained by measuring local projective measurements on certain entangled nonlocal states, namely, on a range of entangled two-qubit Werner states. To prove this result, we introduce a technique for upper bounding the asymptotic key rate of device-independent quantum key distribution protocols, based on a simple eavesdropping attack. Our results imply that either different reconciliation techniques are needed for device-independent quantum key distribution in the large-noise regime, or Bell nonlocality is not sufficient for this task.
The simplest device-independent quantum key distribution protocol is based on the Clauser-Horne-Shimony-Holt (CHSH) Bell inequality and allows two users, Alice and Bob, to generate a secret key if they observe sufficiently strong correlations. There is, however, a mismatch between the protocol, in which only one of Alice's measurements is used to generate the key, and the CHSH expression, which is symmetric with respect to Alice's two measurements. We therefore investigate the impact of using an extended family of Bell expressions where we give different weights to Alice's measurements. Using this family of asymmetric Bell expressions improves the robustness of the key distribution protocol for certain experimentally-relevant correlations. As an example, the tolerable error rate improves from 7.15% to about 7.42% for the depolarising channel. Adding random noise to Alice's key before the postprocessing pushes the threshold further to more than 8.34%. The main technical result of our work is a tight bound on the von Neumann entropy of one of Alice's measurement outcomes conditioned on a quantum eavesdropper for the family of asymmetric CHSH expressions we consider and allowing for an arbitrary amount of noise preprocessing.
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.