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

Experimental Low-Latency Device-Independent Quantum Randomness

Yanbao Zhang, Lynden K. Shalm, Joshua C. Bienfang, Martin J. Stevens, Michael D. Mazurek, Sae Woo Nam, Carlos Abellán, Waldimar Amaya, Morgan W. Mitchell, Honghao Fu, Carl A. Miller, Alan Mink, Emanuel H. Knill

Published Jan 7, 2020• 70 citations
arXivHTMLPDF

Abstract

Applications of randomness such as private key generation and public randomness beacons require small blocks of certified random bits on demand. Device-independent quantum random number generators can produce such random bits, but existing quantum-proof protocols and loophole-free implementations suffer from high latency, requiring many hours to produce any random bits. We demonstrate device-independent quantum randomness generation from a loophole-free Bell test with a more efficient quantum-proof protocol, obtaining multiple blocks of 512 random bits with an average experiment time of less than 5 min per block and with a certified error bounded by 2^{-64}≈5.42×10^{-20}.

DOI
10.1103/physrevlett.124.010505

Related papers

High-Speed Device-Independent Quantum Random Number Generation without a Detection Loophole

Yang Liu, Xiao Yuan, Minghan Li +17 more

Quantum mechanics provides the means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a manner that is independent of implementation devices. Here, we present an experimental study of device-independent quantum random number generation based on a detection-loophole-free Bell test with entangled photons. In the randomness analysis, without the independent identical distribution assumption, we consider the worst case scenario that the adversary launches the most powerful attacks against the quantum adversary. After considering statistical fluctuations and applying an 80 Gb×45.6 Mb Toeplitz matrix hashing, we achieve a final random bit rate of 114 bits/s, with a failure probability less than 10^{-5}. This marks a critical step towards realistic applications in cryptography and fundamental physics tests.

arXiv:1709.06779•Physical Review Letters•Jan 3, 2018•143 citations

A Simple Low-latency Real-time Certifiable Quantum Random Number Generator

Y. Zhang, Hsin-Pin Lo, Takuya Ikuta +3 more

We demonstrate a simple scheme for generating certifiable quantum random numbers considering the imperfections in quantum devices employed. Particularly, we show low-latency real-time randomness generation from measurements on photonic time-bin states. Every 0.12s, we certify enough entropy against a quantum adversary to generate a block of 8192 random bits with a certified error bounded by 10-20. It can be run continuously and is thus well suited as a quantum randomness beacon.

Conference on Lasers and Electro-Optics•Jan 1, 2020•2 citations

Efficient randomness certification by quantum probability estimation

Yanbao Zhang, Honghao Fu, Emanuel H. Knill

For practical applications of quantum randomness generation, it is important to certify and further produce a fixed block of fresh random bits with as few trials as possible.Consequently, protocols with high finite-data efficiency are preferred.To yield such protocols with respect to quantum side information, we develop quantum probability estimation.Our approach is applicable to device-independent as well as device-dependent scenarios, and it generalizes techniques from previous works [Miller and Shi, SIAM J. Comput. 46, 1304 (2017); Arnon-Friedman et al., Nat. Commun. 9, 459 (2018)].Quantum probability estimation can adapt to changing experimental conditions, allows stopping the experiment as soon as the prespecified randomness goal is achieved, and can tolerate imperfect knowledge of the input distribution.Moreover, the randomness rate achieved at constant error is asymptotically optimal.For the device-independent scenario, our approach certifies the amount of randomness available in experimental results without first searching for relations between randomness and violations of fixed Bell inequalities.We implement quantum probability estimation for device-independent randomness generation in the CHSH Bell-test configuration, and we show significant improvements in finite-data efficiency, particularly at small Bell violations which are typical in current photonic loophole-free Bell tests.

Physical Review Research•Jan 7, 2020•49 citations

A simple low-latency real-time certifiable quantum random number generator

Yanbao Zhang, Hsin-Pin Lo, Alan Mink +4 more

Abstract Quantum random numbers distinguish themselves from others by their intrinsic unpredictability arising from the principles of quantum mechanics. As such they are extremely useful in many scientific and real-world applications with considerable efforts going into their realizations. Most demonstrations focus on high asymptotic generation rates. For this goal, a large number of repeated trials are required to accumulate a significant store of certifiable randomness, resulting in a high latency between the initial request and the delivery of the requested random bits. Here we demonstrate low-latency real-time certifiable randomness generation from measurements on photonic time-bin states. For this, we develop methods to certify randomness taking into account adversarial imperfections in both the state preparation and the measurement apparatus. Every 0.12 s we generate a block of 8192 random bits which are certifiable against all quantum adversaries with an error bounded by 2 −64 . Our quantum random number generator is thus well suited for realizing a continuously-operating, high-security and high-speed quantum randomness beacon.

Nature Communications•Feb 24, 2021•37 citations

High speed device-independent quantum random number generation without detection loophole

Yang Liu, Xiao Yuan, Minghan Li +17 more

We report a an experimental study of device-independent quantum random number generation based on an detection-loophole free Bell test with entangled photons. After considering statistical fluctuations and applying an 80 Gb × 45.6 Mb Toeplitz matrix hashing, we achieve a final random bit rate of 114 bits/s, with a failure probability less than 10−5.

Conference on Lasers and Electro-Optics•Jan 1, 2018•30 citations

A real-time low-latency certifiable QRNG

William J. Munro, Yanbao Zhang, Hsin-Pin Lo +4 more

Random numbers which are unpredictable and definitely unknown by anyone before they are generated are now used in a large number of real-world applications ranging from authentication, gaming, many online activities to simulations and optimizations. The development of a trusted randomness source is thus a necessity. In this work we present a simple design of a certifiable quantum random number generation and its. In particular we show how real-time low-latency randomness can be generated from measurements on time-bin photonic states every 0.12s. We generate a block of 2^13 random bits certifiable against the most powerful quantum adversary with its error bounded by 2^-64. Further our device is suitable for continuous operation giving it a potential application as a quantum randomness beacon.

Quantum Communications and Quantum Imaging•Jul 30, 2021•0 citations
Applications of randomness such as private key generation and public randomness beacons require small blocks of certified random bits on demand. Device-independent quantum random number generators can produce such random bits, but existing quantum-proof protocols and loophole-free implementations suffer from high latency, requiring many hours to produce any random bits. We demonstrate device-independent quantum randomness generation from a loophole-free Bell test with a more efficient quantum-proof protocol, obtaining multiple blocks of 512 random bits with an average experiment time of less than 5 min per block and with a certified error bounded by 2^{-64}≈5.42×10^{-20}.
Quantum mechanics provides the means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a manner that is independent of implementation devices. Here, we present an experimental study of device-independent quantum random number generation based on a detection-loophole-free Bell test with entangled photons. In the randomness analysis, without the independent identical distribution assumption, we consider the worst case scenario that the adversary launches the most powerful attacks against the quantum adversary. After considering statistical fluctuations and applying an 80 Gb×45.6 Mb Toeplitz matrix hashing, we achieve a final random bit rate of 114 bits/s, with a failure probability less than 10^{-5}. This marks a critical step towards realistic applications in cryptography and fundamental physics tests.
For practical applications of quantum randomness generation, it is important to certify and further produce a fixed block of fresh random bits with as few trials as possible.Consequently, protocols with high finite-data efficiency are preferred.To yield such protocols with respect to quantum side information, we develop quantum probability estimation.Our approach is applicable to device-independent as well as device-dependent scenarios, and it generalizes techniques from previous works [Miller and Shi, SIAM J. Comput. 46, 1304 (2017); Arnon-Friedman et al., Nat. Commun. 9, 459 (2018)].Quantum probability estimation can adapt to changing experimental conditions, allows stopping the experiment as soon as the prespecified randomness goal is achieved, and can tolerate imperfect knowledge of the input distribution.Moreover, the randomness rate achieved at constant error is asymptotically optimal.For the device-independent scenario, our approach certifies the amount of randomness available in experimental results without first searching for relations between randomness and violations of fixed Bell inequalities.We implement quantum probability estimation for device-independent randomness generation in the CHSH Bell-test configuration, and we show significant improvements in finite-data efficiency, particularly at small Bell violations which are typical in current photonic loophole-free Bell tests.
Abstract Quantum random numbers distinguish themselves from others by their intrinsic unpredictability arising from the principles of quantum mechanics. As such they are extremely useful in many scientific and real-world applications with considerable efforts going into their realizations. Most demonstrations focus on high asymptotic generation rates. For this goal, a large number of repeated trials are required to accumulate a significant store of certifiable randomness, resulting in a high latency between the initial request and the delivery of the requested random bits. Here we demonstrate low-latency real-time certifiable randomness generation from measurements on photonic time-bin states. For this, we develop methods to certify randomness taking into account adversarial imperfections in both the state preparation and the measurement apparatus. Every 0.12 s we generate a block of 8192 random bits which are certifiable against all quantum adversaries with an error bounded by 2 −64 . Our quantum random number generator is thus well suited for realizing a continuously-operating, high-security and high-speed quantum randomness beacon.
Random numbers which are unpredictable and definitely unknown by anyone before they are generated are now used in a large number of real-world applications ranging from authentication, gaming, many online activities to simulations and optimizations. The development of a trusted randomness source is thus a necessity. In this work we present a simple design of a certifiable quantum random number generation and its. In particular we show how real-time low-latency randomness can be generated from measurements on time-bin photonic states every 0.12s. We generate a block of 2^13 random bits certifiable against the most powerful quantum adversary with its error bounded by 2^-64. Further our device is suitable for continuous operation giving it a potential application as a quantum randomness beacon.