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

Role of Nonlocality and Counterfactuality in Quantum Cryptography

H Akshatha Shenoy

Published Jan 1, 2014• 0 citations
OpenAlex

Abstract

Quantum cryptography is arguably the most successfully applied area of quantum information theory. In this work, We invsetigate the role of quantum indistinguishability in random number generation, quantum temporal correlations, quantum nonlocality and counterfactuality for quantum cryptography. We study quantum protocols for key distribution, and their security in the conventional setting, in the counterfactual paradigm, and finally also in the device-independent scenario as applied to prepare-and-measure schemes. We begin with the interplay of two essential non-classical features like quantum indeterminism and quantum indistinguishability via a process known as bosonic stimulation is discussed. It is observed that the process provides an efficient method for macroscopic extraction of quantum randomness. Next, we propose two counterfactual cryptographic protocols, in which a secret key bit is generated even without the physical transmission of a particle. The first protocol is semicounterfactual in the sense that only one of the key bits is generated using interaction-free measurement. This protocol departs fundamentally from the original counterfactual key distribution protocol in not encoding secret bits in terms of photon polarization. We discuss how the security in the protocol originates from quantum single-particle non-locality. The second protocol is designed for the crypto-task of certificate authorization, where a trusted third party authenticates an entity (e.g., bank) to a client. We analyze the security of both protocols under various general incoherent attack models. The next part of our work includes study of quantum temporal correlations. We consider the use of the Leggett-Garg inequalities for device-independent security appropriate for prepare-and-measure protocols subjected to the higher dimensional attack that would completely undermine standard BB84. In the last part, we introduce the novel concept of nonlocal subspaces constructed using the graph state formalism, and propose their application for quantum information splitting. In particular, we use the stabilizer formalism of graph states to construct degenerate Bell operators, whose eigenspace determines the nonlocal subspace, into which a quantum secret is encoded and shared among an authorized group of agents, or securely transmitted to a designated secret retriever. The security of our scheme arises from the monogamy of quantum correlations. The quantum violation of the Bell-type inequality here is to its algebraic maximum, making this approach inherently suitable for the device-independent scenario.

Related papers

"Nonlocality-of-a-single-photon" based Quantum Key Distribution and Random Number Generation schemes and their device-independent security analysis

Konrad Schlichtholz, Bianka Wołoncewicz, Tamoghna Das +2 more

The question of “non-locality of a single photon'', which started with a paper by Tan, Walls and Collett (TWC, 1991) stirred a thirty years long debate. This hampered attempts to use the TWC interferometric scheme in quantum cryptography. The scheme involves a single photon 50-50 beam-split into two modes propagating to two spatially separated observation stations at which weak homodyne measurements are made. The physics and non-classicality of such an arrangement has been understood only recently, and points out that an unquestionable Bell non-classicality, as was suggested by Hardy (1994), can be observed when the local measurement settings differ by the weak local oscillator being on or off, and additionally the homodyning for the on case is not balanced. Based on that, we present a single-photon based device-independent quantum key distribution scheme secure even against no-signaling eavesdropping. In our protocol the random bits of the cryptographic key are obtained by measurements on the single photon, that is for off settings at both Alice and Bob sides, while the security is positively tested if for eavesdropping testing runs one observes a violation of a specific Bell inequality involving the on and off weak homodyne measurements as alternative local settings. The security analysis presented here is based on a decomposition of the correlations into extreme points of a no-signaling polytope, which allows for identification of the optimal strategy for any eavesdropping constrained only by the no-signaling principle. For this strategy, the key rate is calculated, which is then connected with the violation of a specific Clauser-Horne inequality. We also adapt this analysis to propose a self-testing quantum random number generator based on the old idea that employs the randomness of reflection and transmission events of a quantum light impinged on a 50-50 beamsplitter.

arXiv:2311.07451•Quantum•Apr 28, 2026•6 citations

Quantum correlations in prepare-and-measure scenarios and their semi-device-independent applications

Jonatan Bohr Brask, Nicolas Brunner, Jef Pauwels +2 more

A key aspect in quantum information is to understand the advantage offered by quantum systems over classical ones in communication tasks. In recent years, a fundamental approach to this problem has been developed, focusing on quantum correlations in prepare-and-measure scenarios. Inspired by the developments in Bell nonlocality and device-independent information processing, this line of research aims to characterize the possibilities and limits of quantum systems for communication, in particular to precisely capture the advantage they offer over classical systems. In addition to fundamental insights, these ideas also underpin the concept of semi-device-independent quantum information processing. Exploring trade-offs between security, performance and ease-of-implementation, this approach opens promising directions for novel quantum information processing technologies and devices. A number of protocols and proof-of-principle demonstrations have been reported in recent years, in particular for quantum randomness certification and key distribution. Here, we provide a comprehensive introduction to quantum prepare-and-measure correlations and semi-device independent applications.

quant-pharXiv:2603.23604•Mar 26, 2026•21 citations

Approaches to Practical Quantum Cryptography

Peter Yuen

There are various practical obstacles in quantum cryptography. These include the problems that arise in implementing quantum cryptographic protocols with current and near-term technology, and those that come with the development and security analysis of new protocols. In this work, we examine a few of these obstacles and, for each one, we highlight an approach that aims to mitigate it. We start by examining the setting of device-independence, with oblivious transfer in the bounded-quantum-storage-model as the primitive of interest. The typical approach to enabling device-independence is the use of a Bell-inequality violation, which requires a strict non-communication assumption that is practically difficult to enforce. We develop and analyze the security of a device-independent oblivious transfer protocol that replaces the Bell-inequality violation approach with a computational assumption, thereby relaxing the non-communication assumption. Our second topic examines the problem of noise in a quantum money scheme. We show how to achieve noise-tolerance in the public-key setting. Our scheme can be seen as a generalization of the [AC12] scheme: a valid banknote is now a subspace state possibly affected by noise, and verification is performed by using classical oracles to check for membership in "larger spaces." Additionally, a banknote in our scheme is minted by preparing conjugate coding states and applying a unitary. For our last topic, we consider the general task of proving security against a specious adversary, which is the quantum analogue of the classical semi-honest adversary. A useful feature of specious adversaries is that security against them can guarantee security against stronger adversaries [DNS12]. This motivates the search for a canonical specious adversary, where proving security against such an adversary guarantees security against the entire class of specious adversaries. Within a restricted setting, we define a particular specious adversary and show that it satisfies our definition of canonical.

•Jul 7, 2025•0 citations

More Than One-bit Quantum Randomness Certification and Expansion

Amélie Piveteau, Alban Seguinard, Marcus Grünfeld +4 more

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.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 23, 2025•0 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

Quantum Complementarity Approach to Device-Independent Security

Xingjian Zhang, Pei Zeng, Ye Tian +2 more

Complementarity is an essential feature of quantum mechanics. The preparation of an eigenstate of one observable implies complete randomness in its complementary observable. In quantum cryptography, complementarity allows us to formulate security analyses in terms of phase-error correction. However, the concept becomes much subtler in the device-independent regime that offers security without device characterization. Security proofs of device-independent quantum cryptography tasks are often complex and quite different from those of their more standard device-dependent cousins. The existing proofs pose huge challenges to experiments, among which large data-size requirement is a crux. Here, we show the complementarity security origin of the device-independent tasks. By linking complementarity with quantum nonlocality, we recast the device-independent scheme into a quantum error correction protocol. Going beyond the identical-and-independent-distribution case, we consider the most general attack. We generalize the sample entropy in classical Shannon theory for the finite-size analysis. Our method exhibits good finite-size performance and brings the device-independent scheme to a more practical regime. Applying it to the data in a recent ion-trap-based device-independent quantum key distribution experiment, one could reduce the requirement on data size to less than a third. Furthermore, the operational meaning of complementarity naturally extends device-independent scenarios to advantage key distillation, easing experiments by tolerating higher loss and lower transmittance.

arXiv:2111.13855•Physical Review Letters•Oct 3, 2023•18 citations
Quantum cryptography is arguably the most successfully applied area of quantum information theory. In this work, We invsetigate the role of quantum indistinguishability in random number
generation, quantum temporal correlations, quantum nonlocality and counterfactuality for quantum cryptography. We study quantum protocols for key distribution, and their security in the conventional setting, in the counterfactual paradigm, and finally also in the device-independent scenario as applied to prepare-and-measure schemes.
We begin with the interplay of two essential non-classical features like quantum indeterminism and quantum indistinguishability via a process known as bosonic stimulation is discussed. It
is observed that the process provides an efficient method for macroscopic extraction of quantum randomness.
Next, we propose two counterfactual cryptographic protocols, in which a secret key bit is generated even without the physical transmission of a particle. The first protocol is semicounterfactual in the sense that only one of the key bits is generated using interaction-free
measurement. This protocol departs fundamentally from the original counterfactual key distribution protocol in not encoding secret bits in terms of photon polarization. We discuss how the security in the protocol originates from quantum single-particle non-locality. The second protocol is designed for the crypto-task of certificate authorization, where a trusted third party authenticates an entity (e.g., bank) to a client. We analyze the security of both protocols under various general incoherent attack models.
The next part of our work includes study of quantum temporal correlations. We consider the use of the Leggett-Garg inequalities for device-independent security appropriate for prepare-and-measure protocols subjected to the higher dimensional attack that would completely undermine standard BB84.
In the last part, we introduce the novel concept of nonlocal subspaces constructed using the graph state formalism, and propose their application for quantum information splitting. In particular, we use the stabilizer formalism of graph states to construct degenerate Bell operators,
whose eigenspace determines the nonlocal subspace, into which a quantum secret is encoded and shared among an authorized group of agents, or securely transmitted to a designated secret retriever. The security of our scheme arises from the monogamy of quantum correlations. The quantum violation of the Bell-type inequality here is to its algebraic maximum, making this approach inherently suitable for the device-independent scenario.
The question of “non-locality of a single photon'', which started with a paper by Tan, Walls and Collett (TWC, 1991) stirred a thirty years long debate. This hampered attempts to use the TWC interferometric scheme in quantum cryptography. The scheme involves a single photon 50-50 beam-split into two modes propagating to two spatially separated observation stations at which weak homodyne measurements are made. The physics and non-classicality of such an arrangement has been understood only recently, and points out that an unquestionable Bell non-classicality, as was suggested by Hardy (1994), can be observed when the local measurement settings differ by the weak local oscillator being on or off, and additionally the homodyning for the on case is not balanced. Based on that, we present a single-photon based device-independent quantum key distribution scheme secure even against no-signaling eavesdropping. In our protocol the random bits of the cryptographic key are obtained by measurements on the single photon, that is for off settings at both Alice and Bob sides, while the security is positively tested if for eavesdropping testing runs one observes a violation of a specific Bell inequality involving the on and off weak homodyne measurements as alternative local settings. The security analysis presented here is based on a decomposition of the correlations into extreme points of a no-signaling polytope, which allows for identification of the optimal strategy for any eavesdropping constrained only by the no-signaling principle. For this strategy, the key rate is calculated, which is then connected with the violation of a specific Clauser-Horne inequality. We also adapt this analysis to propose a self-testing quantum random number generator based on the old idea that employs the randomness of reflection and transmission events of a quantum light impinged on a 50-50 beamsplitter.
A key aspect in quantum information is to understand the advantage offered by quantum systems over classical ones in communication tasks. In recent years, a fundamental approach to this problem has been developed, focusing on quantum correlations in prepare-and-measure scenarios. Inspired by the developments in Bell nonlocality and device-independent information processing, this line of research aims to characterize the possibilities and limits of quantum systems for communication, in particular to precisely capture the advantage they offer over classical systems. In addition to fundamental insights, these ideas also underpin the concept of semi-device-independent quantum information processing. Exploring trade-offs between security, performance and ease-of-implementation, this approach opens promising directions for novel quantum information processing technologies and devices. A number of protocols and proof-of-principle demonstrations have been reported in recent years, in particular for quantum randomness certification and key distribution. Here, we provide a comprehensive introduction to quantum prepare-and-measure correlations and semi-device independent applications.
There are various practical obstacles in quantum cryptography. These include the problems that arise in implementing quantum cryptographic protocols with current and near-term technology, and those that come with the development and security analysis of new protocols. In this work, we examine a few of these obstacles and, for each one, we highlight an approach that aims to mitigate it. We start by examining the setting of device-independence, with oblivious transfer in the bounded-quantum-storage-model as the primitive of interest. The typical approach to enabling device-independence is the use of a Bell-inequality violation, which requires a strict non-communication assumption that is practically difficult to enforce. We develop and analyze the security of a device-independent oblivious transfer protocol that replaces the Bell-inequality violation approach with a computational assumption, thereby relaxing the non-communication assumption. Our second topic examines the problem of noise in a quantum money scheme. We show how to achieve noise-tolerance in the public-key setting. Our scheme can be seen as a generalization of the [AC12] scheme: a valid banknote is now a subspace state possibly affected by noise, and verification is performed by using classical oracles to check for membership in "larger spaces." Additionally, a banknote in our scheme is minted by preparing conjugate coding states and applying a unitary. For our last topic, we consider the general task of proving security against a specious adversary, which is the quantum analogue of the classical semi-honest adversary. A useful feature of specious adversaries is that security against them can guarantee security against stronger adversaries [DNS12]. This motivates the search for a canonical specious adversary, where proving security against such an adversary guarantees security against the entire class of specious adversaries. Within a restricted setting, we define a particular specious adversary and show that it satisfies our definition of canonical.
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.
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.
Complementarity is an essential feature of quantum mechanics. The preparation of an eigenstate of one observable implies complete randomness in its complementary observable. In quantum cryptography, complementarity allows us to formulate security analyses in terms of phase-error correction. However, the concept becomes much subtler in the device-independent regime that offers security without device characterization. Security proofs of device-independent quantum cryptography tasks are often complex and quite different from those of their more standard device-dependent cousins. The existing proofs pose huge challenges to experiments, among which large data-size requirement is a crux. Here, we show the complementarity security origin of the device-independent tasks. By linking complementarity with quantum nonlocality, we recast the device-independent scheme into a quantum error correction protocol. Going beyond the identical-and-independent-distribution case, we consider the most general attack. We generalize the sample entropy in classical Shannon theory for the finite-size analysis. Our method exhibits good finite-size performance and brings the device-independent scheme to a more practical regime. Applying it to the data in a recent ion-trap-based device-independent quantum key distribution experiment, one could reduce the requirement on data size to less than a third. Furthermore, the operational meaning of complementarity naturally extends device-independent scenarios to advantage key distillation, easing experiments by tolerating higher loss and lower transmittance.