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:2410.11082 · Physical Review Applied

Generalized measurements on qubits in quantum randomness certification and expansion

Piotr Mironowicz, Marcus Grünfeld, Mohamed Bourennane

Published Oct 17, 2024• 6 citations
arXivHTMLPDF

Abstract

Quantum mechanics has greatly impacted our understanding of microscopic nature. One of the key concepts of this theory is generalized measurements, which have proven useful in various quantum information processing tasks. However, despite their significance, they have not yet been shown empirically to provide an advantage in quantum randomness certification and expansion protocols. This investigation explores scenarios where generalized measurements can yield more than 1 bit of certified randomness with a single-qubit system measurement on untrusted devices and against a quantum adversary. We compare the robustness of several protocols to exhibit the advantage of exploiting generalized measurements. In our analysis of experimental data, we were able to obtain 1.21 bits of min-entropy from a measurement taken on one qubit of an entangled state. We also obtained 1.07 bits of min-entropy from an experiment with quantum state preparation and generalized measurement on a single qubit. We also provide finite data analysis for a protocol using generalized measurements and the Entropy Accumulation Theorem. Our exploration demonstrates the potential of generalized measurements to improve the certification of quantum sources of randomness and enhance the security of quantum cryptographic protocols and other areas of quantum information. Published by the American Physical Society 2024

DOI
10.1103/physrevapplied.22.044041

Related papers

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

Improving semi-device-independent randomness certification by entropy accumulation

Carles Roch i Carceller, Lucas Nunes Faria, Zhenghao Liu +4 more

Certified randomness guaranteed to be unpredictable by adversaries is central to information security. The fundamental randomness inherent in quantum physics makes certification possible from devices that are only weakly characterized, i.e., requiring little trust in their implementation. It was recently shown that the amount of certifiable randomness can be improved using the so-called entropy accumulation theorem generalized to prepare-and-measure settings. Furthermore, this approach allows a finite-size analysis which avoids assuming that all rounds are independent and identically distributed. Here, we demonstrate this improvement in semi-device-independent randomness certification from untrusted measurements.

arXiv:2405.04244•Physical Review A•Aug 4, 2025•8 citations

Advances in quantum key distribution and quantum randomness generation

Thinh P. Le

Quantum information science has completely changed the way we think about and process information. From the simple realization that information is physical, we have been able to use the peculiar features of quantum mechanical phenomena to our advantage. Designing algorithms whose performance exceeds those running on classical computers, and performing secret communication whose security can actually be proven from sound assumptions are two main catalysts for the establishment of the field. This thesis discusses some progress in quantum key distribution and quantum randomness generation. Quantum key distribution, which is motivated by the increasing need to communicate securely, is on the verge of becoming an established technology. With the goal of extending the reach of quantum key distribution to more realistic scenarios, we present a study on reference-frame-independent protocols whose knowledge can help design more efficient protocols, and a framework to the security analysis of distributed-phase-reference protocols, which have been missing for many years. This allows these protocols to be used in practice against the most general adversary, although the key rate is rather pessimistic. In quantum randomness generation, the amount of extractable randomness from a quantum system depends on the level of trust or characterization of the devices; we present a study into such interaction. In the extreme situation of distrust, i.e. device-independent scenarios, we study the effect of the input randomness on the certifying power of such scenarios, and realize that one cannot amplify an arbitrary min-entropy source device-independently. Finally we discuss the amount of randomness in post-selected data, which has consequences on practical randomness generation protocols. The in depth study of randomness generation from quantum processes is well justified by the important role of randomness in modern computer science and other fields.

•Jan 1, 2015•0 citations

Assessing randomness with the aid of quantum state measurement

Mathew R. Coleman, Kaylin G. Ingalls, John T. Kavulich +4 more

Randomness is a valuable resource in science, cryptography, engineering, and information technology. Quantum-mechanical sources of randomness are attractive because of the indeterminism of individual quantum processes. Here, we consider the production of random bits from polarization measurements on photons. We first present a pedagogical discussion of how the quantum randomness inherent in such measurements is connected to quantum coherence, and how it can be quantified in terms of the quantum state and an associated entropy value known as min-entropy. We then explore these concepts by performing a series of single-photon experiments that are suitable for the undergraduate laboratory. We prepare photons in different nonentangled and entangled states, and measure these states tomographically. We use the information about the quantum state to determine, in terms of the min-entropy, the minimum amount of randomness produced from a given photon state by different bit-generating measurements. This is helpful in assessing the presence of quantum randomness and in ensuring the quality and security of the random-bit source.

arXiv:2002.09568•American Journal of Physics•Feb 20, 2020•2 citations

Noise robustness of three outcome Bell certified quantum randomness

Raffaele D'Avino, Ignacio Perito, Piotr Mironowicz +2 more

We investigate device-independent certification of global randomness based on Bell inequality violations in bipartite scenarios with three outcomes per party. Our goal is to determine whether multi-outcome measurements allow one to surpass the amount of randomness achievable with binary outputs in realistic scenarios. We begin by analyzing several known Bell expressions and evaluating their robustness against noise for randomness certification. We then introduce a systematic method for generating new Bell expressions within structured families and perform a large-scale numerical study. We find that a substantial number of inequalities certify significant amounts of min-entropy. In particular, we identify simple inequalities that achieve near-maximal global randomness while involving a reduced number of measurement settings, thus improving the balance between certified randomness and number of inputs. Moreover, the vast majority of nontrivial certificates exhibit robustness against realistic noise, maintaining positive certified randomness away from the ideal regime. These results demonstrate that strong device-independent randomness expansion in multi-outcome scenarios is not restricted to carefully engineered inequalities, but arises generically within suitably constructed families of Bell expressions.

quant-pharXiv:2606.21371•Jun 22, 2026•1 citation

Optimal randomness certification from one entangled bit

Antonio Acín, Stefano Pironio, Tamás Vértesi +1 more

By performing local projective measurements on a two-qubit entangled state one can certify in a device-independent way up to one bit of randomness. We show here that general measurements, defined by positive-operator-valued measures, can certify up to two bits of randomness, which is the optimal amount of randomness that can be certified from an entangled bit. General measurements thus provide an advantage over projective ones for device-independent randomness certification.

arXiv:1505.03837•Physical Review A•Apr 18, 2016•141 citations
Quantum mechanics has greatly impacted our understanding of microscopic nature. One of the key concepts of this theory is generalized measurements, which have proven useful in various quantum information processing tasks. However, despite their significance, they have not yet been shown empirically to provide an advantage in quantum randomness certification and expansion protocols. This investigation explores scenarios where generalized measurements can yield more than 1 bit of certified randomness with a single-qubit system measurement on untrusted devices and against a quantum adversary. We compare the robustness of several protocols to exhibit the advantage of exploiting generalized measurements. In our analysis of experimental data, we were able to obtain 1.21 bits of min-entropy from a measurement taken on one qubit of an entangled state. We also obtained 1.07 bits of min-entropy from an experiment with quantum state preparation and generalized measurement on a single qubit. We also provide finite data analysis for a protocol using generalized measurements and the Entropy Accumulation Theorem. Our exploration demonstrates the potential of generalized measurements to improve the certification of quantum sources of randomness and enhance the security of quantum cryptographic protocols and other areas of quantum information. Published by the American Physical Society 2024
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.
Certified randomness guaranteed to be unpredictable by adversaries is central to information security. The fundamental randomness inherent in quantum physics makes certification possible from devices that are only weakly characterized, i.e., requiring little trust in their implementation. It was recently shown that the amount of certifiable randomness can be improved using the so-called entropy accumulation theorem generalized to prepare-and-measure settings. Furthermore, this approach allows a finite-size analysis which avoids assuming that all rounds are independent and identically distributed. Here, we demonstrate this improvement in semi-device-independent randomness certification from untrusted measurements.
Quantum information science has completely changed the way we think about and process information. From the simple realization that information is physical, we have been able to use the peculiar features of quantum mechanical phenomena to our advantage. Designing algorithms whose performance exceeds those running on classical computers, and performing secret communication whose security can actually be proven from sound assumptions are two main catalysts for the establishment of the field. This thesis discusses some progress in quantum key distribution and quantum randomness generation. Quantum key distribution, which is motivated by the increasing need to communicate securely, is on the verge of becoming an established technology. With the goal of extending the reach of quantum key distribution to more realistic scenarios, we present a study on reference-frame-independent protocols whose knowledge can help design more efficient protocols, and a framework to the security analysis of distributed-phase-reference protocols, which have been missing for many years. This allows these protocols to be used in practice against the most general adversary, although the key rate is rather pessimistic. In quantum randomness generation, the amount of extractable randomness from a quantum system depends on the level of trust or characterization of the devices; we present a study into such interaction. In the extreme situation of distrust, i.e. device-independent scenarios, we study the effect of the input randomness on the certifying power of such scenarios, and realize that one cannot amplify an arbitrary min-entropy source device-independently. Finally we discuss the amount of randomness in post-selected data, which has consequences on practical randomness generation protocols. The in depth study of randomness generation from quantum processes is well justified by the important role of randomness in modern computer science and other fields.
Randomness is a valuable resource in science, cryptography, engineering, and information technology. Quantum-mechanical sources of randomness are attractive because of the indeterminism of individual quantum processes. Here, we consider the production of random bits from polarization measurements on photons. We first present a pedagogical discussion of how the quantum randomness inherent in such measurements is connected to quantum coherence, and how it can be quantified in terms of the quantum state and an associated entropy value known as min-entropy. We then explore these concepts by performing a series of single-photon experiments that are suitable for the undergraduate laboratory. We prepare photons in different nonentangled and entangled states, and measure these states tomographically. We use the information about the quantum state to determine, in terms of the min-entropy, the minimum amount of randomness produced from a given photon state by different bit-generating measurements. This is helpful in assessing the presence of quantum randomness and in ensuring the quality and security of the random-bit source.
We investigate device-independent certification of global randomness based on Bell inequality violations in bipartite scenarios with three outcomes per party. Our goal is to determine whether multi-outcome measurements allow one to surpass the amount of randomness achievable with binary outputs in realistic scenarios. We begin by analyzing several known Bell expressions and evaluating their robustness against noise for randomness certification. We then introduce a systematic method for generating new Bell expressions within structured families and perform a large-scale numerical study. We find that a substantial number of inequalities certify significant amounts of min-entropy. In particular, we identify simple inequalities that achieve near-maximal global randomness while involving a reduced number of measurement settings, thus improving the balance between certified randomness and number of inputs. Moreover, the vast majority of nontrivial certificates exhibit robustness against realistic noise, maintaining positive certified randomness away from the ideal regime. These results demonstrate that strong device-independent randomness expansion in multi-outcome scenarios is not restricted to carefully engineered inequalities, but arises generically within suitably constructed families of Bell expressions.