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

Experimentally generated randomness certified by the impossibility of superluminal signals

Peter Bierhorst, Emanuel H. Knill, Scott Glancy, Yanbao Zhang, Alan Mink, Stephen P. Jordan, Andrea Rommal, Yi-Kai Liu, Bradley Christensen, Sae Woo Nam, Martin J. Stevens, Lynden K. Shalm

Published Jan 1, 2018• 190 citations
OpenAlex

Abstract

Abstract From dice to modern electronic circuits, there have been many attempts to build better devices to generate random numbers. Randomness is fundamental to security and cryptographic systems and to safeguarding privacy. A key challenge with random-number generators is that it is hard to ensure that their outputs are unpredictable1–3. For a random-number generator based on a physical process, such as a noisy classical system or an elementary quantum measurement, a detailed model that describes the underlying physics is necessary to assert unpredictability. Imperfections in the model compromise the integrity of the device. However, it is possible to exploit the phenomenon of quantum non-locality with a loophole-free Bell test to build a random-number generator that can produce output that is unpredictable to any adversary that is limited only by general physical principles, such as special relativity1–11. With recent technological developments, it is now possible to carry out such a loophole-free Bell test12–14, 22. Here we present certified randomness obtained from a photonic Bell experiment and extract 1, 024 random bits that are uniformly distributed to within 10−12. These random bits could not have been predicted according to any physical theory that prohibits faster-than-light (superluminal) signalling and that allows independent measurement choices. To certify and quantify the randomness, we describe a protocol that is optimized for devices that are characterized by a low per-trial violation of Bell inequalities. Future random-number generators based on loophole-free Bell tests may have a role in increasing the security and trust of our cryptographic systems and infrastructure.

Related papers

Device-Independent Randomness Amplification

Anatoly Kulikov, Simon Storz, Josua Schär +6 more

Successful realization of Bell tests has settled an 80-year-long debate, proving the existence of correlations which cannot be explained by a local realistic model. Recent experimental progress allowed to rule out any possible loopholes in these tests, and opened up the possibility of applications in cryptography envisaged more than three decades ago. A prominent example of such an application is device-independent quantum key distribution, which has recently been demonstrated. One remaining gap in all existing experiments, however, is that access to perfect randomness is assumed. To tackle this problem, the concept of randomness amplification has been introduced, allowing to generate such randomness from a weak source -- a task impossible in classical physics. In this work, we demonstrate the amplification of imperfect randomness coming from a physical source. It is achieved by building on two recent developments: The first is a theoretical protocol implementing the concept of randomness amplification within an experimentally realistic setup, which however requires a combination of the degree of Bell inequality violation (S-value) and the amount of data not attained previously. The second is experimental progress enabling the execution of a loophole-free Bell test with superconducting circuits, which offers a platform to reach the necessary combination. Our experiment marks an important step in achieving the theoretical physical limits of privacy and randomness generation.

arXiv:2412.17931•Dec 23, 2024•0 citations

Experimental randomness amplification

Anatoly Kulikov, Simon Storz, Josua Schär +6 more

Abstract Realistic quantum information processing devices are inherently imperfect, leading to computational errors that require quantum error correction. Likewise, random bits generated by such devices are flawed and must be enhanced to be usable for applications such as generating cryptographic keys. This enhancement of randomness quality is achieved through a protocol known as randomness amplification 1 . Here we report on an experiment that implements such a protocol. Randomness amplification is device-independent, making no assumptions about the internal workings of the quantum devices. It requires executing a loophole-free Bell test 2–4 within a specific parameter regime that involves both a high Bell violation and a high repetition rate. The experimental demonstration is made possible by a combination of theoretical advances, which allow for protocols with an experimentally realistic parameter regime, and experimental progress that achieves this regime with superconducting circuits. Crucially, randomness amplification has been proven to be impossible by purely classical means 5 . This experiment therefore demonstrates a definitive quantum advantage—leveraging quantum technology to accomplish a task unattainable by classical information processing.

Nature•May 27, 2026•4 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

Single-System-Based Generation of Certified Randomness Using Leggett-Garg Inequality

Pingal Pratyush Nath, Debashis Saha, Dipankar Home +1 more

We theoretically formulate and experimentally demonstrate a secure scheme for semi-device-independent quantum random number generation by utilizing Leggett-Garg inequality violations, within a loophole-free photonic architecture. The quantification of the generated randomness is rigorously estimated by analytical as well as numerical approaches, both of which are in perfect agreement. We securely generate 919 118 truly unpredictable bits at a rate of 3865 bits/sec. This opens up an unexplored avenue toward an empirically convenient class of reliable random number generators harnessing the quantumness of single systems.

arXiv:2402.03712•Physical Review Letters•Jul 10, 2024•12 citations

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

Testing randomness of series generated in an optical Bell’s experiment

Myriam Nonaka, Mónica Agüero, Marcelo Gregorio Kovalsky +1 more

The generation of series of random numbers is an important and difficult problem. Appropriate measurements on entangled states have been proposed as the definitive solution to produce series of certified randomness, and quantum optical systems play a major role. However, several reports indicate that random number generators based on quantum measurements have a high rate of series rejected by standard tests of randomness. This is believed to be caused by experimental imperfections and is usually solved by using classical algorithms to extract randomness. This is acceptable to generate random numbers in a single place. In quantum key distribution (QKD) instead, if the extractor is known by an eavesdropper (a situation that cannot be ruled out), the key's security may be menaced. We use a not-loophole-free, "toy" all-fiber-optic-based setup, mimicking a QKD one operating in the field, to generate binary series and evaluate their level of randomness according to Ville's principle. The series are tested with a battery of indicators of statistical and algorithmic randomness and nonlinear analysis. The good performance of a simple method to get random series from rejected ones, previously reported by Solis et al. is confirmed and supported with additional arguments. Incidentally, a theoretically predicted relationship between complexity and entropy is verified. Regarding QKD, the level of randomness of series, obtained by applying Toeplitz's extractor to rejected series, is found to be indistinguishable from the level of non-rejected raw ones.

arXiv:2208.14986•Applied Optics•Mar 23, 2023•3 citations
Abstract From dice to modern electronic circuits, there have been many attempts to build better devices to generate random numbers. Randomness is fundamental to security and cryptographic systems and to safeguarding privacy. A key challenge with random-number generators is that it is hard to ensure that their outputs are unpredictable1–3. For a random-number generator based on a physical process, such as a noisy classical system or an elementary quantum measurement, a detailed model that describes the underlying physics is necessary to assert unpredictability. Imperfections in the model compromise the integrity of the device. However, it is possible to exploit the phenomenon of quantum non-locality with a loophole-free Bell test to build a random-number generator that can produce output that is unpredictable to any adversary that is limited only by general physical principles, such as special relativity1–11. With recent technological developments, it is now possible to carry out such a loophole-free Bell test12–14, 22. Here we present certified randomness obtained from a photonic Bell experiment and extract 1, 024 random bits that are uniformly distributed to within 10−12. These random bits could not have been predicted according to any physical theory that prohibits faster-than-light (superluminal) signalling and that allows independent measurement choices. To certify and quantify the randomness, we describe a protocol that is optimized for devices that are characterized by a low per-trial violation of Bell inequalities. Future random-number generators based on loophole-free Bell tests may have a role in increasing the security and trust of our cryptographic systems and infrastructure.
Successful realization of Bell tests has settled an 80-year-long debate, proving the existence of correlations which cannot be explained by a local realistic model. Recent experimental progress allowed to rule out any possible loopholes in these tests, and opened up the possibility of applications in cryptography envisaged more than three decades ago. A prominent example of such an application is device-independent quantum key distribution, which has recently been demonstrated. One remaining gap in all existing experiments, however, is that access to perfect randomness is assumed. To tackle this problem, the concept of randomness amplification has been introduced, allowing to generate such randomness from a weak source -- a task impossible in classical physics. In this work, we demonstrate the amplification of imperfect randomness coming from a physical source. It is achieved by building on two recent developments: The first is a theoretical protocol implementing the concept of randomness amplification within an experimentally realistic setup, which however requires a combination of the degree of Bell inequality violation (S-value) and the amount of data not attained previously. The second is experimental progress enabling the execution of a loophole-free Bell test with superconducting circuits, which offers a platform to reach the necessary combination. Our experiment marks an important step in achieving the theoretical physical limits of privacy and randomness generation.
Abstract Realistic quantum information processing devices are inherently imperfect, leading to computational errors that require quantum error correction. Likewise, random bits generated by such devices are flawed and must be enhanced to be usable for applications such as generating cryptographic keys. This enhancement of randomness quality is achieved through a protocol known as randomness amplification 1 . Here we report on an experiment that implements such a protocol. Randomness amplification is device-independent, making no assumptions about the internal workings of the quantum devices. It requires executing a loophole-free Bell test 2–4 within a specific parameter regime that involves both a high Bell violation and a high repetition rate. The experimental demonstration is made possible by a combination of theoretical advances, which allow for protocols with an experimentally realistic parameter regime, and experimental progress that achieves this regime with superconducting circuits. Crucially, randomness amplification has been proven to be impossible by purely classical means 5 . This experiment therefore demonstrates a definitive quantum advantage—leveraging quantum technology to accomplish a task unattainable by classical information processing.
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.
We theoretically formulate and experimentally demonstrate a secure scheme for semi-device-independent quantum random number generation by utilizing Leggett-Garg inequality violations, within a loophole-free photonic architecture. The quantification of the generated randomness is rigorously estimated by analytical as well as numerical approaches, both of which are in perfect agreement. We securely generate 919 118 truly unpredictable bits at a rate of 3865 bits/sec. This opens up an unexplored avenue toward an empirically convenient class of reliable random number generators harnessing the quantumness of single systems.
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.
The generation of series of random numbers is an important and difficult problem. Appropriate measurements on entangled states have been proposed as the definitive solution to produce series of certified randomness, and quantum optical systems play a major role. However, several reports indicate that random number generators based on quantum measurements have a high rate of series rejected by standard tests of randomness. This is believed to be caused by experimental imperfections and is usually solved by using classical algorithms to extract randomness. This is acceptable to generate random numbers in a single place. In quantum key distribution (QKD) instead, if the extractor is known by an eavesdropper (a situation that cannot be ruled out), the key's security may be menaced. We use a not-loophole-free, "toy" all-fiber-optic-based setup, mimicking a QKD one operating in the field, to generate binary series and evaluate their level of randomness according to Ville's principle. The series are tested with a battery of indicators of statistical and algorithmic randomness and nonlinear analysis. The good performance of a simple method to get random series from rejected ones, previously reported by Solis et al. is confirmed and supported with additional arguments. Incidentally, a theoretically predicted relationship between complexity and entropy is verified. Regarding QKD, the level of randomness of series, obtained by applying Toeplitz's extractor to rejected series, is found to be indistinguishable from the level of non-rejected raw ones.