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

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)

More Than One-bit Quantum Randomness Certification and Expansion

Amélie Piveteau, Alban Seguinard, Marcus Grünfeld, H. Arwer, Nassim Ahmed Mahammedi, Piotr Mironowicz, Mohamed Bourennane

Published Jun 23, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.1109/cleo/europe-eqec65582.2025.11109587

Related papers

Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario

Alban Seguinard, Amélie Piveteau, Piotr Mironowicz +1 more

Abstract 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 they are 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. In this paper, 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 provide lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy in a device-independent scenario. We compare experimental setups providing Bell violations close to the Tsirelson’s bound with lower rates of events, with setups having slightly worse levels of violation but higher event rates. Our results demonstrate the first experiment that certifies close to two bits of randomness from binary measurements of two parties. Apart from single-round certification, we provide an analysis of finite-key protocol for quantum randomness expansion using the Entropy Accumulation theorem and show its advantages compared to existing solutions.

arXiv:2303.07460•New Journal of Physics•Oct 20, 2023•7 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•0 citations

Generalized measurements on qubits in quantum randomness certification and expansion

Piotr Mironowicz, Marcus Grünfeld, Mohamed Bourennane

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

arXiv:2410.11082•Physical Review Applied•Oct 17, 2024•5 citations

Extensive search of Shannon entropy-based randomness certification protocols

Robert Okuła, Piotr Mironowicz

Quantum technologies offer significant advancements in information processing and communication, notably in the domain of random number generation (RNG). The use of Bell inequalities enables users to certify the randomness of outputs produced by untrusted quantum RNG devices. We present a method for quantitatively analyzing Bell expressions used to certify randomness in quantum systems. Using this method, we conducted a comprehensive analysis on more than half a million Bell expressions involving configurations with four measurement settings for one party and three for the other. We identified five notable examples based on entropy scores under varying levels of white noise. As an extension of these results, we further incorporate the concept of self-testing for boxes (Banacki et al 2022, New J. Phys. 24 083003), enabling a more comprehensive characterization of quantum correlations through the evaluation of $Boxes(α, B)$ and the corresponding measure $Flex(α, B)$.

quant-pharXiv:2511.22771•Dec 1, 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•4 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•33 citations
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.
Abstract 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 they are 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. In this paper, 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 provide lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy in a device-independent scenario. We compare experimental setups providing Bell violations close to the Tsirelson’s bound with lower rates of events, with setups having slightly worse levels of violation but higher event rates. Our results demonstrate the first experiment that certifies close to two bits of randomness from binary measurements of two parties. Apart from single-round certification, we provide an analysis of finite-key protocol for quantum randomness expansion using the Entropy Accumulation theorem and show its advantages compared to existing solutions.
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.
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
Quantum technologies offer significant advancements in information processing and communication, notably in the domain of random number generation (RNG). The use of Bell inequalities enables users to certify the randomness of outputs produced by untrusted quantum RNG devices. We present a method for quantitatively analyzing Bell expressions used to certify randomness in quantum systems. Using this method, we conducted a comprehensive analysis on more than half a million Bell expressions involving configurations with four measurement settings for one party and three for the other. We identified five notable examples based on entropy scores under varying levels of white noise. As an extension of these results, we further incorporate the concept of self-testing for boxes (Banacki et al 2022, New J. Phys. 24 083003), enabling a more comprehensive characterization of quantum correlations through the evaluation of Boxes(α,B)Boxes(α, B)Boxes(α,B) and the corresponding measure Flex(α,B)Flex(α, B)Flex(α,B).
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.
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.